/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:48:07,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:48:07,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:48:07,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:48:07,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:48:07,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:48:07,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:48:07,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:48:07,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:48:07,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:48:07,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:48:07,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:48:07,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:48:07,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:48:07,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:48:07,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:48:07,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:48:07,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:48:07,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:48:07,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:48:07,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:48:07,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:48:07,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:48:07,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:48:07,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:48:07,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:48:07,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:48:07,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:48:07,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:48:07,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:48:07,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:48:07,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:48:07,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:48:07,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:48:07,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:48:07,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:48:07,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:48:07,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:48:07,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:48:07,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:48:07,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:48:07,500 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:48:07,514 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:48:07,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:48:07,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:48:07,516 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:48:07,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:48:07,516 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:48:07,516 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:48:07,516 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:48:07,517 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:48:07,517 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:48:07,517 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:48:07,517 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:48:07,517 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:48:07,517 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:48:07,518 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:48:07,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:48:07,518 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:48:07,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:48:07,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:48:07,519 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:48:07,519 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:48:07,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:48:07,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:48:07,519 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:48:07,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:48:07,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:48:07,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:48:07,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:48:07,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:48:07,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:48:07,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:48:07,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:48:07,708 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:48:07,708 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:48:07,709 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:48:07,776 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_GZNc8V/tmp/c1492c0f165b452d969ed9b26cb79f5f/FLAG8eace1e94 [2020-07-01 12:48:08,117 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:48:08,118 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:48:08,118 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:48:08,124 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_GZNc8V/tmp/c1492c0f165b452d969ed9b26cb79f5f/FLAG8eace1e94 [2020-07-01 12:48:08,521 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_GZNc8V/tmp/c1492c0f165b452d969ed9b26cb79f5f [2020-07-01 12:48:08,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:48:08,534 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:48:08,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:48:08,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:48:08,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:48:08,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cfb4a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08, skipping insertion in model container [2020-07-01 12:48:08,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:48:08,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:48:08,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:48:08,794 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:48:08,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:48:08,824 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:48:08,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08 WrapperNode [2020-07-01 12:48:08,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:48:08,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:48:08,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:48:08,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:48:08,835 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:48:08" (1/1) ... [2020-07-01 12:48:08,843 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:48:08" (1/1) ... [2020-07-01 12:48:08,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:48:08,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:48:08,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:48:08,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:48:08,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (1/1) ... [2020-07-01 12:48:08,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:48:08,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:48:08,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:48:08,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:48:08,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48: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:48:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:48:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:48:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:48:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:48:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:48:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:48:09,235 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:48:09,235 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:48:09,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:09 BoogieIcfgContainer [2020-07-01 12:48:09,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:48:09,241 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:48:09,241 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:48:09,243 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:48:09,244 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:09" (1/1) ... [2020-07-01 12:48:09,259 INFO L313 BlockEncoder]: Initial Icfg 35 locations, 36 edges [2020-07-01 12:48:09,260 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:48:09,261 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:48:09,262 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:48:09,262 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:48:09,264 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:48:09,265 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:48:09,265 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:48:09,288 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:48:09,319 INFO L200 BlockEncoder]: SBE split 17 edges [2020-07-01 12:48:09,324 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:48:09,326 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:48:09,357 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:48:09,360 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:48:09,361 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:48:09,361 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:48:09,366 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 12:48:09,367 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:48:09,367 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:48:09,368 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:48:09,368 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:48:09,369 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:48:09,369 INFO L313 BlockEncoder]: Encoded RCFG 26 locations, 45 edges [2020-07-01 12:48:09,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:09 BasicIcfg [2020-07-01 12:48:09,370 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:48:09,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:48:09,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:48:09,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:48:09,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:48:08" (1/4) ... [2020-07-01 12:48:09,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2d883a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:48:09, skipping insertion in model container [2020-07-01 12:48:09,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (2/4) ... [2020-07-01 12:48:09,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2d883a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:48:09, skipping insertion in model container [2020-07-01 12:48:09,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:09" (3/4) ... [2020-07-01 12:48:09,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2d883a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:09, skipping insertion in model container [2020-07-01 12:48:09,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:09" (4/4) ... [2020-07-01 12:48:09,379 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:48:09,389 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:48:09,397 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-01 12:48:09,411 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-01 12:48:09,434 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:48:09,435 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:48:09,435 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:48:09,435 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:48:09,435 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:48:09,435 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:48:09,435 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:48:09,435 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:48:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-01 12:48:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:48:09,457 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:48:09,458 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,464 INFO L82 PathProgramCache]: Analyzing trace with hash 111829, now seen corresponding path program 1 times [2020-07-01 12:48:09,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541604408] [2020-07-01 12:48:09,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,624 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:48:09,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541604408] [2020-07-01 12:48:09,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197646093] [2020-07-01 12:48:09,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,649 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-07-01 12:48:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,751 INFO L93 Difference]: Finished difference Result 50 states and 85 transitions. [2020-07-01 12:48:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:09,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:48:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,765 INFO L225 Difference]: With dead ends: 50 [2020-07-01 12:48:09,765 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:48:09,769 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:48:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:48:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:48:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:48:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. [2020-07-01 12:48:09,805 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 3 [2020-07-01 12:48:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,805 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 42 transitions. [2020-07-01 12:48:09,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions. [2020-07-01 12:48:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:48:09,806 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:48:09,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:48:09,808 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,809 INFO L82 PathProgramCache]: Analyzing trace with hash 111860, now seen corresponding path program 1 times [2020-07-01 12:48:09,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305846786] [2020-07-01 12:48:09,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,845 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:48:09,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305846786] [2020-07-01 12:48:09,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384790527] [2020-07-01 12:48:09,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,848 INFO L87 Difference]: Start difference. First operand 26 states and 42 transitions. Second operand 3 states. [2020-07-01 12:48:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:09,945 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-07-01 12:48:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:09,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:48:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:09,946 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:48:09,946 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:48:09,947 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:48:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:48:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:48:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:48:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2020-07-01 12:48:09,952 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 3 [2020-07-01 12:48:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:09,952 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 34 transitions. [2020-07-01 12:48:09,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2020-07-01 12:48:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:48:09,953 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:09,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:48:09,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:48:09,953 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash 111862, now seen corresponding path program 1 times [2020-07-01 12:48:09,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:09,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789440282] [2020-07-01 12:48:09,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:09,985 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:48:09,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789440282] [2020-07-01 12:48:09,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:09,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:09,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521274995] [2020-07-01 12:48:09,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:09,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:09,987 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 3 states. [2020-07-01 12:48:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,045 INFO L93 Difference]: Finished difference Result 22 states and 34 transitions. [2020-07-01 12:48:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:48:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,067 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:48:10,068 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:48:10,068 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:48:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:48:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:48:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:48:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-07-01 12:48:10,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 3 [2020-07-01 12:48:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,072 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-01 12:48:10,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-01 12:48:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:48:10,073 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:48:10,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:48:10,073 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash 3466718, now seen corresponding path program 1 times [2020-07-01 12:48:10,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301394756] [2020-07-01 12:48:10,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,124 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:48:10,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301394756] [2020-07-01 12:48:10,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:10,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481885522] [2020-07-01 12:48:10,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:10,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,126 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 3 states. [2020-07-01 12:48:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,179 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2020-07-01 12:48:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:48:10,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,181 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:48:10,181 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 12:48:10,181 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:48:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 12:48:10,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 12:48:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:48:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-07-01 12:48:10,185 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 4 [2020-07-01 12:48:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,185 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-01 12:48:10,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2020-07-01 12:48:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:48:10,186 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:48:10,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:48:10,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:48:10,186 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:48:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,187 INFO L82 PathProgramCache]: Analyzing trace with hash 3466715, now seen corresponding path program 1 times [2020-07-01 12:48:10,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583769493] [2020-07-01 12:48:10,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,221 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:48:10,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583769493] [2020-07-01 12:48:10,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:10,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548951519] [2020-07-01 12:48:10,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:48:10,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:10,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,224 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 3 states. [2020-07-01 12:48:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,259 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-07-01 12:48:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:48:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:48:10,260 INFO L225 Difference]: With dead ends: 14 [2020-07-01 12:48:10,260 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:48:10,261 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:48:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:48:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:48:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:48:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:48:10,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-07-01 12:48:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:48:10,262 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:48:10,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:48:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:48:10,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:48:10,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:48:10,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:48:10,293 INFO L268 CegarLoopResult]: For program point L7-1(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,293 INFO L268 CegarLoopResult]: For program point L7-4(lines 7 9) no Hoare annotation was computed. [2020-07-01 12:48:10,293 INFO L268 CegarLoopResult]: For program point L7-6(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,293 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:48:10,294 INFO L264 CegarLoopResult]: At program point L7-8(lines 7 9) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 0 ULTIMATE.start_main_~j~0.offset) (<= 1 |#StackHeapBarrier|)) [2020-07-01 12:48:10,294 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:48:10,294 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,294 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,294 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,294 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:48:10,294 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:48:10,295 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,295 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:48:10,295 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,295 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,295 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:48:10,295 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,295 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,295 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-07-01 12:48:10,296 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-01 12:48:10,296 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,296 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-01 12:48:10,296 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:48:10,296 INFO L268 CegarLoopResult]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-07-01 12:48:10,296 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-01 12:48:10,296 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-07-01 12:48:10,299 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:48:10,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:10,314 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,314 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,315 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:10,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:10 BasicIcfg [2020-07-01 12:48:10,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:48:10,318 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:48:10,318 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:48:10,321 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:48:10,322 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:10,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:48:08" (1/5) ... [2020-07-01 12:48:10,322 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1640ad8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:48:10, skipping insertion in model container [2020-07-01 12:48:10,322 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:10,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:48:08" (2/5) ... [2020-07-01 12:48:10,323 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1640ad8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:48:10, skipping insertion in model container [2020-07-01 12:48:10,323 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:10,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:48:09" (3/5) ... [2020-07-01 12:48:10,323 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1640ad8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:48:10, skipping insertion in model container [2020-07-01 12:48:10,324 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:10,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:48:09" (4/5) ... [2020-07-01 12:48:10,324 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1640ad8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:48:10, skipping insertion in model container [2020-07-01 12:48:10,324 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:48:10,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:48:10" (5/5) ... [2020-07-01 12:48:10,325 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:48:10,346 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:48:10,347 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:48:10,347 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:48:10,347 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:48:10,347 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:48:10,347 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:48:10,347 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:48:10,347 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:48:10,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-07-01 12:48:10,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 12:48:10,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:48:10,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:48:10,362 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:48:10,362 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,362 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:48:10,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-07-01 12:48:10,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 12:48:10,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:48:10,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:48:10,364 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:48:10,365 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:48:10,370 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [82] 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] 9#L-1true [104] L-1-->L6: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_#length_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_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|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 21#L6true [71] L6-->L6-1: Formula: (and (= (store |v_#memory_int_2| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 1)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~j~0.base_4)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~j~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 19#L6-1true [67] L6-1-->L7-8: Formula: (and (= (store |v_#memory_int_4| v_ULTIMATE.start_main_~i~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4 10000)) |v_#memory_int_3|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~i~0.base_4)) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_6|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 10#L7-8true [2020-07-01 12:48:10,371 INFO L796 eck$LassoCheckResult]: Loop: 10#L7-8true [53] L7-8-->L7-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem4_2|)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5#L7-1true [144] L7-1-->L8: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_14) (<= (+ (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~j~0.base_18) v_ULTIMATE.start_main_~j~0.offset_14) 1) |v_ULTIMATE.start_main_#t~mem4_14|) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_18)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_14 4) (select |v_#length_24| v_ULTIMATE.start_main_~j~0.base_18))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_14, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_18, #length=|v_#length_24|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_14|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_14, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_18, #length=|v_#length_24|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_13|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 25#L8true [138] L8-->L8-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~j~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem6_5| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (= |v_ULTIMATE.start_main_#t~post7_5| |v_ULTIMATE.start_main_#t~mem6_5|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_20|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 22#L8-2true [141] L8-2-->L7-4: Formula: (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_main_~j~0.base_17)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_13) (= (store |v_#memory_int_15| v_ULTIMATE.start_main_~j~0.base_17 (store (select |v_#memory_int_15| v_ULTIMATE.start_main_~j~0.base_17) v_ULTIMATE.start_main_~j~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post7_7| 1))) |v_#memory_int_14|) (<= (+ v_ULTIMATE.start_main_~j~0.offset_13 4) (select |v_#length_21| v_ULTIMATE.start_main_~j~0.base_17))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_13, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_17, #length=|v_#length_21|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_7|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_13, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_17, #length=|v_#length_21|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~post7] 16#L7-4true [142] L7-4-->L7-6: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~i~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem2_5| (select (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= |v_ULTIMATE.start_main_#t~post3_5| |v_ULTIMATE.start_main_#t~mem2_5|)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_33|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_5|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2] 14#L7-6true [143] L7-6-->L7-8: Formula: (and (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~i~0.base_17)) (= |v_#memory_int_17| (store |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17) v_ULTIMATE.start_main_~i~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post3_7| (- 1))))) (<= (+ v_ULTIMATE.start_main_~i~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_main_~i~0.base_17)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_13)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_7|, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2, #memory_int] 10#L7-8true [2020-07-01 12:48:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash 3468595, now seen corresponding path program 1 times [2020-07-01 12:48:10,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066657390] [2020-07-01 12:48:10,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:48:10,391 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:48:10,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066657390] [2020-07-01 12:48:10,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:48:10,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:48:10,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601017555] [2020-07-01 12:48:10,393 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:48:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:48:10,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1752880384, now seen corresponding path program 1 times [2020-07-01 12:48:10,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:48:10,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454145654] [2020-07-01 12:48:10,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:48:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:48:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:48:10,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:48:10,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:48:10,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:48:10,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:48:10,529 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-07-01 12:48:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:48:10,583 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-07-01 12:48:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:48:10,586 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:48:10,590 INFO L168 Benchmark]: Toolchain (without parser) took 2056.06 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 561.5 MB in the beginning and 493.9 MB in the end (delta: 67.6 MB). Peak memory consumption was 104.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,591 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:48:10,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.40 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 561.5 MB in the beginning and 649.1 MB in the end (delta: -87.6 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.71 ms. Allocated memory is still 686.3 MB. Free memory was 649.1 MB in the beginning and 646.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:48:10,593 INFO L168 Benchmark]: Boogie Preprocessor took 23.40 ms. Allocated memory is still 686.3 MB. Free memory was 646.9 MB in the beginning and 645.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:48:10,593 INFO L168 Benchmark]: RCFGBuilder took 352.96 ms. Allocated memory is still 686.3 MB. Free memory was 645.8 MB in the beginning and 622.5 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,594 INFO L168 Benchmark]: BlockEncodingV2 took 129.20 ms. Allocated memory is still 686.3 MB. Free memory was 622.5 MB in the beginning and 612.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,594 INFO L168 Benchmark]: TraceAbstraction took 946.15 ms. Allocated memory is still 686.3 MB. Free memory was 612.8 MB in the beginning and 526.0 MB in the end (delta: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,595 INFO L168 Benchmark]: BuchiAutomizer took 270.36 ms. Allocated memory is still 686.3 MB. Free memory was 525.0 MB in the beginning and 493.9 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:48:10,598 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 35 locations, 36 edges - StatisticsResult: Encoded RCFG 26 locations, 45 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 290.40 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 561.5 MB in the beginning and 649.1 MB in the end (delta: -87.6 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.71 ms. Allocated memory is still 686.3 MB. Free memory was 649.1 MB in the beginning and 646.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 23.40 ms. Allocated memory is still 686.3 MB. Free memory was 646.9 MB in the beginning and 645.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 352.96 ms. Allocated memory is still 686.3 MB. Free memory was 645.8 MB in the beginning and 622.5 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 129.20 ms. Allocated memory is still 686.3 MB. Free memory was 622.5 MB in the beginning and 612.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 946.15 ms. Allocated memory is still 686.3 MB. Free memory was 612.8 MB in the beginning and 526.0 MB in the end (delta: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 270.36 ms. Allocated memory is still 686.3 MB. Free memory was 525.0 MB in the beginning and 493.9 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant [2020-07-01 12:48:10,607 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,607 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,607 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:48:10,608 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,608 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:48:10,608 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((4 == unknown-#length-unknown[j] && 1 == \valid[j]) && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == i) && 0 == j) && 1 <= unknown-#StackHeapBarrier-unknown - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.8s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 SDtfs, 119 SDslu, 2 SDs, 0 SdLazy, 119 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 30 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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:48:05.272 ----------------------------------------------- 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_GZNc8V/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:48:10.834 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check