java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loops/heavy_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:24:41,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:24:41,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:24:41,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:24:41,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:24:41,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:24:41,421 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:24:41,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:24:41,425 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:24:41,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:24:41,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:24:41,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:24:41,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:24:41,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:24:41,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:24:41,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:24:41,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:24:41,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:24:41,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:24:41,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:24:41,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:24:41,440 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:24:41,442 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:24:41,442 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:24:41,442 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:24:41,443 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:24:41,444 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:24:41,445 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:24:41,446 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:24:41,447 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:24:41,447 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:24:41,448 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:24:41,448 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:24:41,448 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:24:41,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:24:41,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:24:41,450 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:24:41,465 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:24:41,465 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:24:41,466 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:24:41,466 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:24:41,467 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:24:41,467 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:24:41,467 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:24:41,467 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:24:41,468 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:24:41,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:24:41,468 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:24:41,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:24:41,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:24:41,469 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:24:41,469 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:24:41,469 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:24:41,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:24:41,469 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:24:41,470 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:24:41,470 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:24:41,470 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:24:41,470 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:24:41,470 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:24:41,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:24:41,471 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:24:41,471 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:24:41,471 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:24:41,471 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:24:41,472 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:24:41,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:24:41,472 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:24:41,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:24:41,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:24:41,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:24:41,537 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:24:41,538 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:24:41,539 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy_false-unreach-call.c [2018-11-14 19:24:41,601 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63486ed4e/39770508b7b24072870caa004bee0106/FLAG34a02b478 [2018-11-14 19:24:42,092 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:24:42,092 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy_false-unreach-call.c [2018-11-14 19:24:42,098 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63486ed4e/39770508b7b24072870caa004bee0106/FLAG34a02b478 [2018-11-14 19:24:42,114 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63486ed4e/39770508b7b24072870caa004bee0106 [2018-11-14 19:24:42,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:24:42,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:24:42,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:24:42,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:24:42,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:24:42,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:24:42" (1/1) ... [2018-11-14 19:24:42,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abf0299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42, skipping insertion in model container [2018-11-14 19:24:42,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:24:42" (1/1) ... [2018-11-14 19:24:42,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:24:42,169 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:24:42,354 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:24:42,424 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:24:42,447 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:24:42,516 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:24:42,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42 WrapperNode [2018-11-14 19:24:42,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:24:42,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:24:42,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:24:42,518 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:24:42,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42" (1/1) ... [2018-11-14 19:24:42,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42" (1/1) ... [2018-11-14 19:24:42,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42" (1/1) ... [2018-11-14 19:24:42,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42" (1/1) ... [2018-11-14 19:24:42,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42" (1/1) ... [2018-11-14 19:24:42,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42" (1/1) ... [2018-11-14 19:24:42,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42" (1/1) ... [2018-11-14 19:24:42,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:24:42,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:24:42,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:24:42,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:24:42,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:24:42,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:24:42,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:24:42,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:24:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:24:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:24:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:24:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:24:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:24:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:24:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:24:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:24:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:24:43,235 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:24:43,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:24:43 BoogieIcfgContainer [2018-11-14 19:24:43,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:24:43,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:24:43,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:24:43,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:24:43,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:24:42" (1/3) ... [2018-11-14 19:24:43,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729b6e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:24:43, skipping insertion in model container [2018-11-14 19:24:43,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:42" (2/3) ... [2018-11-14 19:24:43,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729b6e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:24:43, skipping insertion in model container [2018-11-14 19:24:43,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:24:43" (3/3) ... [2018-11-14 19:24:43,245 INFO L112 eAbstractionObserver]: Analyzing ICFG heavy_false-unreach-call.c [2018-11-14 19:24:43,254 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:24:43,261 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:24:43,277 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:24:43,312 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:24:43,313 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:24:43,313 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:24:43,313 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:24:43,313 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:24:43,313 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:24:43,314 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:24:43,314 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:24:43,314 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:24:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-14 19:24:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-14 19:24:43,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:43,338 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:43,341 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:43,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:43,348 INFO L82 PathProgramCache]: Analyzing trace with hash -795757055, now seen corresponding path program 1 times [2018-11-14 19:24:43,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:43,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:43,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:43,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:43,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-14 19:24:43,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset + 0, 1); {25#true} is VALID [2018-11-14 19:24:43,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-14 19:24:43,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #55#return; {25#true} is VALID [2018-11-14 19:24:43,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {25#true} is VALID [2018-11-14 19:24:43,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {25#true} is VALID [2018-11-14 19:24:43,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-14 19:24:43,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} assume ~a~0 % 4294967296 != 0; {26#false} is VALID [2018-11-14 19:24:43,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-14 19:24:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:43,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:43,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:24:43,539 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-14 19:24:43,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:43,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:24:43,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:43,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:24:43,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:24:43,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:24:43,600 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-14 19:24:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:43,963 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2018-11-14 19:24:43,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:24:43,964 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-14 19:24:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:24:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-14 19:24:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:24:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-14 19:24:43,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2018-11-14 19:24:44,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:44,418 INFO L225 Difference]: With dead ends: 38 [2018-11-14 19:24:44,419 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 19:24:44,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:24:44,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 19:24:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 19:24:44,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:44,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 19:24:44,497 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 19:24:44,497 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 19:24:44,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:44,501 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-14 19:24:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 19:24:44,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:44,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:44,502 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 19:24:44,502 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 19:24:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:44,507 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-14 19:24:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 19:24:44,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:44,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:44,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:44,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 19:24:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-14 19:24:44,515 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2018-11-14 19:24:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:44,515 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-14 19:24:44,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:24:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 19:24:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 19:24:44,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:44,517 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:44,518 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:44,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:44,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1100257748, now seen corresponding path program 1 times [2018-11-14 19:24:44,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:44,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:44,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:44,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:44,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:44,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2018-11-14 19:24:44,641 INFO L273 TraceCheckUtils]: 1: Hoare triple {141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset + 0, 1); {141#true} is VALID [2018-11-14 19:24:44,641 INFO L273 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2018-11-14 19:24:44,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #55#return; {141#true} is VALID [2018-11-14 19:24:44,642 INFO L256 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {141#true} is VALID [2018-11-14 19:24:44,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {141#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {143#(= main_~i~0 0)} is VALID [2018-11-14 19:24:44,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {143#(= main_~i~0 0)} assume true; {143#(= main_~i~0 0)} is VALID [2018-11-14 19:24:44,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {143#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 1048576); {142#false} is VALID [2018-11-14 19:24:44,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {142#false} assume ~a~0 % 4294967296 != 0; {142#false} is VALID [2018-11-14 19:24:44,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {142#false} assume !false; {142#false} is VALID [2018-11-14 19:24:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:44,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:44,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:24:44,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-14 19:24:44,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:44,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:24:44,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:44,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:24:44,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:24:44,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:24:44,763 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2018-11-14 19:24:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:44,949 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 19:24:44,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:24:44,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-14 19:24:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:24:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-14 19:24:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:24:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-14 19:24:44,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-14 19:24:45,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:45,015 INFO L225 Difference]: With dead ends: 30 [2018-11-14 19:24:45,016 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 19:24:45,017 INFO L604 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 [2018-11-14 19:24:45,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 19:24:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-14 19:24:45,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:45,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 20 states. [2018-11-14 19:24:45,074 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 20 states. [2018-11-14 19:24:45,075 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 20 states. [2018-11-14 19:24:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:45,078 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 19:24:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 19:24:45,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:45,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:45,079 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 27 states. [2018-11-14 19:24:45,079 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 27 states. [2018-11-14 19:24:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:45,081 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 19:24:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 19:24:45,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:45,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:45,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:45,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:24:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-14 19:24:45,085 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 10 [2018-11-14 19:24:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:45,085 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-14 19:24:45,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:24:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-14 19:24:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:24:45,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:45,086 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:45,087 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:45,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:45,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2045733446, now seen corresponding path program 1 times [2018-11-14 19:24:45,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:45,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:45,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:45,523 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-14 19:24:45,591 INFO L256 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {271#true} is VALID [2018-11-14 19:24:45,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset + 0, 1); {271#true} is VALID [2018-11-14 19:24:45,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2018-11-14 19:24:45,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #55#return; {271#true} is VALID [2018-11-14 19:24:45,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {271#true} is VALID [2018-11-14 19:24:45,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {271#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {273#(= main_~i~0 0)} is VALID [2018-11-14 19:24:45,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {273#(= main_~i~0 0)} assume true; {273#(= main_~i~0 0)} is VALID [2018-11-14 19:24:45,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {273#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {273#(= main_~i~0 0)} is VALID [2018-11-14 19:24:45,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {273#(= main_~i~0 0)} assume true; {273#(= main_~i~0 0)} is VALID [2018-11-14 19:24:45,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {273#(= main_~i~0 0)} assume !(~j~0 % 4294967296 < 1048576); {273#(= main_~i~0 0)} is VALID [2018-11-14 19:24:45,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {273#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {274#(and (<= main_~i~0 1) (< 0 (+ (div main_~i~0 4294967296) 1)))} is INVALID [2018-11-14 19:24:45,679 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: invalid Hoare triple in Craig at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) [2018-11-14 19:24:45,685 INFO L168 Benchmark]: Toolchain (without parser) took 3560.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -674.7 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:45,687 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:24:45,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:45,688 INFO L168 Benchmark]: Boogie Preprocessor took 52.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:24:45,689 INFO L168 Benchmark]: RCFGBuilder took 665.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:45,690 INFO L168 Benchmark]: TraceAbstraction took 2445.42 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 67.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:45,695 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 665.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2445.42 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 67.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: invalid Hoare triple in Craig de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: invalid Hoare triple in Craig: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...