/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:37:06,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:37:06,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:37:06,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:37:06,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:37:06,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:37:06,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:37:06,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:37:06,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:37:06,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:37:06,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:37:06,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:37:06,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:37:06,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:37:06,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:37:06,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:37:06,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:37:06,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:37:06,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:37:06,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:37:06,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:37:06,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:37:06,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:37:06,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:37:06,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:37:06,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:37:06,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:37:06,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:37:06,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:37:06,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:37:06,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:37:06,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:37:06,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:37:06,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:37:06,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:37:06,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:37:06,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:37:06,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:37:06,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:37:06,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:37:06,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:37:06,854 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:37:06,868 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:37:06,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:37:06,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:37:06,869 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:37:06,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:37:06,870 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:37:06,870 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:37:06,870 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:37:06,870 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:37:06,870 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:37:06,871 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:37:06,871 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:37:06,871 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:37:06,871 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:37:06,871 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:37:06,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:37:06,872 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:37:06,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:37:06,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:37:06,872 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:37:06,872 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:37:06,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:37:06,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:37:06,873 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:37:06,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:37:06,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:37:06,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:37:06,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:37:06,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:37:07,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:37:07,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:37:07,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:37:07,056 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:37:07,056 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:37:07,057 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:37:07,122 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Y4SSqE/tmp/8365ceb65b48499b9244c1f530571de8/FLAGf4568ea32 [2020-07-01 12:37:07,452 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:37:07,452 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:37:07,453 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:37:07,459 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Y4SSqE/tmp/8365ceb65b48499b9244c1f530571de8/FLAGf4568ea32 [2020-07-01 12:37:07,861 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_Y4SSqE/tmp/8365ceb65b48499b9244c1f530571de8 [2020-07-01 12:37:07,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:37:07,874 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:37:07,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:37:07,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:37:07,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:37:07,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:37:07" (1/1) ... [2020-07-01 12:37:07,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d04f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:07, skipping insertion in model container [2020-07-01 12:37:07,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:37:07" (1/1) ... [2020-07-01 12:37:07,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:37:07,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:37:08,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:37:08,155 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:37:08,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:37:08,188 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:37:08,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08 WrapperNode [2020-07-01 12:37:08,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:37:08,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:37:08,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:37:08,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:37:08,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (1/1) ... [2020-07-01 12:37:08,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (1/1) ... [2020-07-01 12:37:08,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:37:08,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:37:08,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:37:08,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:37:08,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (1/1) ... [2020-07-01 12:37:08,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (1/1) ... [2020-07-01 12:37:08,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (1/1) ... [2020-07-01 12:37:08,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (1/1) ... [2020-07-01 12:37:08,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (1/1) ... [2020-07-01 12:37:08,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (1/1) ... [2020-07-01 12:37:08,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (1/1) ... [2020-07-01 12:37:08,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:37:08,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:37:08,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:37:08,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:37:08,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:37:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:37:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:37:08,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:37:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:37:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:37:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:37:08,613 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:37:08,613 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:37:08,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:37:08 BoogieIcfgContainer [2020-07-01 12:37:08,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:37:08,618 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:37:08,618 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:37:08,620 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:37:08,621 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:37:08" (1/1) ... [2020-07-01 12:37:08,635 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 46 edges [2020-07-01 12:37:08,637 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:37:08,637 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:37:08,638 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:37:08,638 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:37:08,640 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:37:08,641 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:37:08,641 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:37:08,664 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:37:08,727 INFO L200 BlockEncoder]: SBE split 24 edges [2020-07-01 12:37:08,732 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:37:08,734 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:37:08,762 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 12:37:08,765 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:37:08,766 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:37:08,766 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:37:08,767 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:37:08,767 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:37:08,768 INFO L313 BlockEncoder]: Encoded RCFG 37 locations, 93 edges [2020-07-01 12:37:08,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:37:08 BasicIcfg [2020-07-01 12:37:08,769 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:37:08,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:37:08,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:37:08,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:37:08,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:37:07" (1/4) ... [2020-07-01 12:37:08,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa3ff72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:37:08, skipping insertion in model container [2020-07-01 12:37:08,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (2/4) ... [2020-07-01 12:37:08,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa3ff72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:37:08, skipping insertion in model container [2020-07-01 12:37:08,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:37:08" (3/4) ... [2020-07-01 12:37:08,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa3ff72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:37:08, skipping insertion in model container [2020-07-01 12:37:08,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:37:08" (4/4) ... [2020-07-01 12:37:08,778 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:37:08,789 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:37:08,796 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-07-01 12:37:08,810 INFO L251 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-07-01 12:37:08,833 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:37:08,833 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:37:08,834 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:37:08,834 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:37:08,834 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:37:08,834 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:37:08,834 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:37:08,834 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:37:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-01 12:37:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:37:08,856 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:08,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:37:08,857 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:37:08,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:08,863 INFO L82 PathProgramCache]: Analyzing trace with hash 4215459, now seen corresponding path program 1 times [2020-07-01 12:37:08,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:08,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954386077] [2020-07-01 12:37:08,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:09,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954386077] [2020-07-01 12:37:09,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:09,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:09,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377059411] [2020-07-01 12:37:09,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:09,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:09,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:09,060 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-07-01 12:37:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:09,293 INFO L93 Difference]: Finished difference Result 72 states and 153 transitions. [2020-07-01 12:37:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:09,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:37:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:09,308 INFO L225 Difference]: With dead ends: 72 [2020-07-01 12:37:09,308 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 12:37:09,312 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:09,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 12:37:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 12:37:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:37:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 62 transitions. [2020-07-01 12:37:09,350 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 62 transitions. Word has length 4 [2020-07-01 12:37:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:09,350 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 62 transitions. [2020-07-01 12:37:09,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 62 transitions. [2020-07-01 12:37:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:37:09,351 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:09,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:37:09,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:37:09,353 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:37:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:09,353 INFO L82 PathProgramCache]: Analyzing trace with hash 4234679, now seen corresponding path program 1 times [2020-07-01 12:37:09,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:09,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56389658] [2020-07-01 12:37:09,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:09,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56389658] [2020-07-01 12:37:09,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:09,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:09,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482702418] [2020-07-01 12:37:09,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:09,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:09,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:09,439 INFO L87 Difference]: Start difference. First operand 37 states and 62 transitions. Second operand 3 states. [2020-07-01 12:37:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:09,529 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2020-07-01 12:37:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:09,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:37:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:09,531 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:37:09,531 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:37:09,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:37:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:37:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:37:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions. [2020-07-01 12:37:09,537 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 54 transitions. Word has length 4 [2020-07-01 12:37:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:09,537 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 54 transitions. [2020-07-01 12:37:09,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 54 transitions. [2020-07-01 12:37:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:37:09,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:09,538 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:37:09,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:37:09,538 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:37:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash 4234681, now seen corresponding path program 1 times [2020-07-01 12:37:09,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:09,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041991576] [2020-07-01 12:37:09,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:09,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041991576] [2020-07-01 12:37:09,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:09,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:09,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682902243] [2020-07-01 12:37:09,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:09,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:09,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:09,602 INFO L87 Difference]: Start difference. First operand 33 states and 54 transitions. Second operand 3 states. [2020-07-01 12:37:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:09,689 INFO L93 Difference]: Finished difference Result 33 states and 54 transitions. [2020-07-01 12:37:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:09,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:37:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:09,690 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:37:09,690 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:37:09,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:37:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:37:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:37:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. [2020-07-01 12:37:09,694 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 46 transitions. Word has length 4 [2020-07-01 12:37:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:09,695 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 46 transitions. [2020-07-01 12:37:09,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 46 transitions. [2020-07-01 12:37:09,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:37:09,695 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:09,696 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:37:09,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:37:09,696 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:37:09,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:09,696 INFO L82 PathProgramCache]: Analyzing trace with hash 131272404, now seen corresponding path program 1 times [2020-07-01 12:37:09,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:09,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774083045] [2020-07-01 12:37:09,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:09,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774083045] [2020-07-01 12:37:09,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:09,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:09,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467149573] [2020-07-01 12:37:09,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:09,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:09,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:09,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:09,750 INFO L87 Difference]: Start difference. First operand 29 states and 46 transitions. Second operand 3 states. [2020-07-01 12:37:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:09,812 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2020-07-01 12:37:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:09,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:37:09,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:09,814 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:37:09,814 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:37:09,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:37:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:37:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:37:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2020-07-01 12:37:09,818 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 5 [2020-07-01 12:37:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:09,818 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. [2020-07-01 12:37:09,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2020-07-01 12:37:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:37:09,819 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:09,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:37:09,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:37:09,820 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:37:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:09,820 INFO L82 PathProgramCache]: Analyzing trace with hash 131272406, now seen corresponding path program 1 times [2020-07-01 12:37:09,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:09,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889640513] [2020-07-01 12:37:09,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:09,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889640513] [2020-07-01 12:37:09,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:09,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:09,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843782808] [2020-07-01 12:37:09,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:09,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:09,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:09,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:09,881 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand 3 states. [2020-07-01 12:37:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:09,961 INFO L93 Difference]: Finished difference Result 26 states and 40 transitions. [2020-07-01 12:37:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:09,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:37:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:09,963 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:37:09,963 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:37:09,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:37:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:37:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:37:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2020-07-01 12:37:09,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 5 [2020-07-01 12:37:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:09,967 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2020-07-01 12:37:09,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2020-07-01 12:37:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:37:09,968 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:09,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:09,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:37:09,968 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:37:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1981018689, now seen corresponding path program 1 times [2020-07-01 12:37:09,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:09,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184279302] [2020-07-01 12:37:09,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:10,000 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184279302] [2020-07-01 12:37:10,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:10,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:10,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794781444] [2020-07-01 12:37:10,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:10,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:10,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:10,002 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 3 states. [2020-07-01 12:37:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:10,068 INFO L93 Difference]: Finished difference Result 43 states and 64 transitions. [2020-07-01 12:37:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:10,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 12:37:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:10,070 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:37:10,070 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:37:10,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:37:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:37:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:37:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-07-01 12:37:10,073 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 8 [2020-07-01 12:37:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:10,073 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-07-01 12:37:10,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-07-01 12:37:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:37:10,074 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:10,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:10,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:37:10,075 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:37:10,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1981017728, now seen corresponding path program 1 times [2020-07-01 12:37:10,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:10,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68552783] [2020-07-01 12:37:10,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:10,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68552783] [2020-07-01 12:37:10,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:10,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:10,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264016527] [2020-07-01 12:37:10,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:10,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:10,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:10,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:10,119 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2020-07-01 12:37:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:10,159 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-07-01 12:37:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:10,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 12:37:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:10,160 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:37:10,161 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:37:10,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:37:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:37:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:37:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-07-01 12:37:10,163 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 8 [2020-07-01 12:37:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:10,164 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-07-01 12:37:10,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2020-07-01 12:37:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:37:10,165 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:10,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:10,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:37:10,165 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:37:10,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:10,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1981017726, now seen corresponding path program 1 times [2020-07-01 12:37:10,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:10,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882608616] [2020-07-01 12:37:10,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:10,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882608616] [2020-07-01 12:37:10,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:10,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:10,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983319924] [2020-07-01 12:37:10,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:10,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:10,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:10,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:10,201 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 3 states. [2020-07-01 12:37:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:10,223 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-01 12:37:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:10,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 12:37:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:10,224 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:37:10,224 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:37:10,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:37:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:37:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:37:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-07-01 12:37:10,227 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 8 [2020-07-01 12:37:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:10,227 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-01 12:37:10,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-01 12:37:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:37:10,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:37:10,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:10,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:37:10,228 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:37:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:10,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1981017725, now seen corresponding path program 1 times [2020-07-01 12:37:10,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:10,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958051657] [2020-07-01 12:37:10,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:10,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958051657] [2020-07-01 12:37:10,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:10,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:10,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811329351] [2020-07-01 12:37:10,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:37:10,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:10,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:10,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:10,277 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2020-07-01 12:37:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:10,308 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-01 12:37:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:10,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 12:37:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:37:10,309 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:37:10,310 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:37:10,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:37:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:37:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:37:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:37:10,311 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2020-07-01 12:37:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:37:10,311 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:37:10,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:37:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:37:10,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:37:10,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:37:10,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:37:10,320 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:37:10,320 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:37:10,320 INFO L268 CegarLoopResult]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-07-01 12:37:10,320 INFO L268 CegarLoopResult]: For program point L11(lines 11 15) no Hoare annotation was computed. [2020-07-01 12:37:10,320 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:37:10,320 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:37:10,320 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:37:10,320 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:37:10,321 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:37:10,321 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:37:10,321 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:37:10,321 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:37:10,321 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:37:10,321 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:37:10,321 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:37:10,321 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 12:37:10,322 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:37:10,322 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:37:10,322 INFO L268 CegarLoopResult]: For program point L18-2(line 18) no Hoare annotation was computed. [2020-07-01 12:37:10,322 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:37:10,322 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:37:10,322 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:37:10,322 INFO L268 CegarLoopResult]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-07-01 12:37:10,322 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:37:10,322 INFO L268 CegarLoopResult]: For program point L16-3(line 16) no Hoare annotation was computed. [2020-07-01 12:37:10,323 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:37:10,323 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:37:10,323 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:37:10,323 INFO L268 CegarLoopResult]: For program point L16-5(lines 16 19) no Hoare annotation was computed. [2020-07-01 12:37:10,323 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:37:10,324 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:37:10,324 INFO L268 CegarLoopResult]: For program point L16-7(lines 5 21) no Hoare annotation was computed. [2020-07-01 12:37:10,324 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:37:10,324 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:37:10,324 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:37:10,324 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:37:10,324 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:37:10,327 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:37:10,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:37:10 BasicIcfg [2020-07-01 12:37:10,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:37:10,330 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:37:10,331 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:37:10,334 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:37:10,335 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:37:10,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:37:07" (1/5) ... [2020-07-01 12:37:10,336 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b723a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:37:10, skipping insertion in model container [2020-07-01 12:37:10,336 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:37:10,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:37:08" (2/5) ... [2020-07-01 12:37:10,336 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b723a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:37:10, skipping insertion in model container [2020-07-01 12:37:10,336 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:37:10,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:37:08" (3/5) ... [2020-07-01 12:37:10,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b723a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:37:10, skipping insertion in model container [2020-07-01 12:37:10,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:37:10,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:37:08" (4/5) ... [2020-07-01 12:37:10,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b723a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:37:10, skipping insertion in model container [2020-07-01 12:37:10,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:37:10,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:37:10" (5/5) ... [2020-07-01 12:37:10,339 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:37:10,362 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:37:10,362 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:37:10,363 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:37:10,363 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:37:10,363 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:37:10,363 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:37:10,363 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:37:10,363 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:37:10,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-07-01 12:37:10,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:37:10,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:37:10,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:37:10,379 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:37:10,380 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:10,380 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:37:10,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-07-01 12:37:10,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:37:10,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:37:10,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:37:10,383 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:37:10,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:37:10,389 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue [106] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [165] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (and (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~m~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~m~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1)) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc4.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~n~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= v_ULTIMATE.start_main_~n~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc3.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_~n~0.offset=v_ULTIMATE.start_main_~n~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~n~0.base=v_ULTIMATE.start_main_~n~0.base_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_~m~0.base=v_ULTIMATE.start_main_~m~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~m~0.offset=v_ULTIMATE.start_main_~m~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~n~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~n~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_~m~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~m~0.offset, ULTIMATE.start_main_#t~mem6] 36#L11true [167] L11-->L12: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 18#L12true [81] L12-->L16-7: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4 1))) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_4)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#memory_int] 32#L16-7true [2020-07-01 12:37:10,390 INFO L796 eck$LassoCheckResult]: Loop: 32#L16-7true [103] L16-7-->L16: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~y~0.base_4)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 5#L16true [180] L16-->L16-1: Formula: (and (not |v_ULTIMATE.start_main_#t~short8_2|) (>= |v_ULTIMATE.start_main_#t~mem6_3| 100)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 3#L16-1true [65] L16-1-->L16-5: Formula: (not |v_ULTIMATE.start_main_#t~short8_5|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} AuxVars[] AssignedVars[] 16#L16-5true [80] L16-5-->L17: Formula: |v_ULTIMATE.start_main_#t~short8_9| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_9|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 28#L17true [98] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 26#L17-1true [95] L17-1-->L17-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~x~0.base_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 24#L17-2true [215] L17-2-->L18: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem10_6| |v_ULTIMATE.start_main_#t~mem9_6|))) |v_#memory_int_15|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_27| v_ULTIMATE.start_main_~y~0.base_13)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_13))) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, #memory_int] 10#L18true [74] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 8#L18-1true [71] L18-1-->L18-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_13)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 6#L18-2true [216] L18-2-->L16-7: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~z~0.base_13)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_10) (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~z~0.base_13) v_ULTIMATE.start_main_~z~0.offset_10 (+ (* |v_ULTIMATE.start_main_#t~mem12_6| (- 1)) |v_ULTIMATE.start_main_#t~mem11_6|))) |v_#memory_int_17|) (<= (+ v_ULTIMATE.start_main_~z~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~z~0.base_13))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_13, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, #memory_int] 32#L16-7true [2020-07-01 12:37:10,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:10,391 INFO L82 PathProgramCache]: Analyzing trace with hash 4245190, now seen corresponding path program 1 times [2020-07-01 12:37:10,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:10,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423441626] [2020-07-01 12:37:10,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:10,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423441626] [2020-07-01 12:37:10,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:10,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:37:10,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359472431] [2020-07-01 12:37:10,414 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:37:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:37:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1283019618, now seen corresponding path program 1 times [2020-07-01 12:37:10,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:37:10,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709157751] [2020-07-01 12:37:10,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:37:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:37:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:37:10,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709157751] [2020-07-01 12:37:10,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:37:10,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:37:10,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77898250] [2020-07-01 12:37:10,432 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:37:10,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:37:10,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:37:10,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:37:10,433 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-07-01 12:37:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:37:10,603 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2020-07-01 12:37:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:37:10,606 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:37:10,611 INFO L168 Benchmark]: Toolchain (without parser) took 2736.39 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 561.3 MB in the beginning and 398.8 MB in the end (delta: 162.5 MB). Peak memory consumption was 201.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:37:10,611 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:37:10,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.94 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 561.3 MB in the beginning and 650.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:37:10,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.34 ms. Allocated memory is still 688.4 MB. Free memory was 650.0 MB in the beginning and 647.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:37:10,613 INFO L168 Benchmark]: Boogie Preprocessor took 24.69 ms. Allocated memory is still 688.4 MB. Free memory was 647.9 MB in the beginning and 646.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:37:10,614 INFO L168 Benchmark]: RCFGBuilder took 362.74 ms. Allocated memory is still 688.4 MB. Free memory was 646.8 MB in the beginning and 621.0 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:37:10,614 INFO L168 Benchmark]: BlockEncodingV2 took 150.67 ms. Allocated memory is still 688.4 MB. Free memory was 621.0 MB in the beginning and 601.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:37:10,615 INFO L168 Benchmark]: TraceAbstraction took 1560.00 ms. Allocated memory is still 688.4 MB. Free memory was 601.6 MB in the beginning and 435.3 MB in the end (delta: 166.3 MB). Peak memory consumption was 166.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:37:10,615 INFO L168 Benchmark]: BuchiAutomizer took 278.08 ms. Allocated memory is still 688.4 MB. Free memory was 434.2 MB in the beginning and 398.8 MB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:37:10,619 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 43 locations, 46 edges - StatisticsResult: Encoded RCFG 37 locations, 93 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 313.94 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 561.3 MB in the beginning and 650.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.34 ms. Allocated memory is still 688.4 MB. Free memory was 650.0 MB in the beginning and 647.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.69 ms. Allocated memory is still 688.4 MB. Free memory was 647.9 MB in the beginning and 646.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 362.74 ms. Allocated memory is still 688.4 MB. Free memory was 646.8 MB in the beginning and 621.0 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 150.67 ms. Allocated memory is still 688.4 MB. Free memory was 621.0 MB in the beginning and 601.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1560.00 ms. Allocated memory is still 688.4 MB. Free memory was 601.6 MB in the beginning and 435.3 MB in the end (delta: 166.3 MB). Peak memory consumption was 166.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 278.08 ms. Allocated memory is still 688.4 MB. Free memory was 434.2 MB in the beginning and 398.8 MB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 20 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 68 SDtfs, 267 SDslu, 30 SDs, 0 SdLazy, 290 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 1072 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:37:04.637 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_Y4SSqE/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:37:10.862 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check