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.epf -i ../../../trunk/examples/svcomp/array-tiling/mbpr2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:04:14,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:04:14,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:04:14,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:04:14,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:04:14,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:04:14,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:04:14,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:04:14,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:04:14,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:04:14,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:04:14,376 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:04:14,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:04:14,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:04:14,379 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:04:14,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:04:14,381 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:04:14,383 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:04:14,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:04:14,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:04:14,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:04:14,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:04:14,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:04:14,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:04:14,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:04:14,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:04:14,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:04:14,403 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:04:14,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:04:14,407 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:04:14,408 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:04:14,409 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:04:14,409 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:04:14,409 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:04:14,410 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:04:14,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:04:14,412 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:04:14,443 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:04:14,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:04:14,447 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:04:14,447 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:04:14,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:04:14,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:04:14,448 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:04:14,448 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:04:14,448 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:04:14,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:04:14,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:04:14,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:04:14,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:04:14,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:04:14,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:04:14,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:04:14,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:04:14,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:04:14,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:04:14,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:04:14,453 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:04:14,453 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:04:14,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:04:14,453 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:04:14,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:04:14,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:04:14,454 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:04:14,454 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:04:14,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:04:14,455 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:04:14,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:04:14,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:04:14,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:04:14,539 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:04:14,540 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:04:14,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr2_true-unreach-call.i [2018-11-14 17:04:14,600 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a11bacfa/b336a444f898470989a5016508b3881c/FLAG98ddd51c3 [2018-11-14 17:04:15,012 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:04:15,012 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr2_true-unreach-call.i [2018-11-14 17:04:15,020 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a11bacfa/b336a444f898470989a5016508b3881c/FLAG98ddd51c3 [2018-11-14 17:04:15,035 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a11bacfa/b336a444f898470989a5016508b3881c [2018-11-14 17:04:15,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:04:15,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:04:15,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:04:15,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:04:15,052 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:04:15,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:04:15" (1/1) ... [2018-11-14 17:04:15,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd8c054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15, skipping insertion in model container [2018-11-14 17:04:15,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:04:15" (1/1) ... [2018-11-14 17:04:15,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:04:15,092 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:04:15,352 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:04:15,360 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:04:15,400 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:04:15,428 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:04:15,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15 WrapperNode [2018-11-14 17:04:15,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:04:15,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:04:15,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:04:15,430 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:04:15,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15" (1/1) ... [2018-11-14 17:04:15,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15" (1/1) ... [2018-11-14 17:04:15,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15" (1/1) ... [2018-11-14 17:04:15,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15" (1/1) ... [2018-11-14 17:04:15,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15" (1/1) ... [2018-11-14 17:04:15,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15" (1/1) ... [2018-11-14 17:04:15,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15" (1/1) ... [2018-11-14 17:04:15,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:04:15,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:04:15,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:04:15,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:04:15,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15" (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 17:04:15,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:04:15,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:04:15,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:04:15,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:04:15,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:04:15,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:04:15,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:04:15,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:04:15,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:04:15,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:04:15,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:04:15,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:04:15,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:04:15,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:04:15,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:04:15,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:04:16,398 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:04:16,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:16 BoogieIcfgContainer [2018-11-14 17:04:16,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:04:16,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:04:16,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:04:16,403 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:04:16,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:04:15" (1/3) ... [2018-11-14 17:04:16,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141a35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:04:16, skipping insertion in model container [2018-11-14 17:04:16,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:15" (2/3) ... [2018-11-14 17:04:16,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141a35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:04:16, skipping insertion in model container [2018-11-14 17:04:16,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:16" (3/3) ... [2018-11-14 17:04:16,407 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr2_true-unreach-call.i [2018-11-14 17:04:16,419 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:04:16,428 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:04:16,447 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:04:16,486 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:04:16,487 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:04:16,487 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:04:16,487 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:04:16,488 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:04:16,488 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:04:16,488 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:04:16,488 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:04:16,488 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:04:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-14 17:04:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:04:16,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:16,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:16,521 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:16,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1460369926, now seen corresponding path program 1 times [2018-11-14 17:04:16,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:16,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:16,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:16,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:16,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:16,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-14 17:04:16,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {41#true} is VALID [2018-11-14 17:04:16,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-14 17:04:16,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #97#return; {41#true} is VALID [2018-11-14 17:04:16,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret10 := main(); {41#true} is VALID [2018-11-14 17:04:16,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {41#true} is VALID [2018-11-14 17:04:16,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {41#true} is VALID [2018-11-14 17:04:16,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {41#true} is VALID [2018-11-14 17:04:16,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#true} assume !true; {42#false} is VALID [2018-11-14 17:04:16,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {42#false} ~i~0 := 1; {42#false} is VALID [2018-11-14 17:04:16,781 INFO L273 TraceCheckUtils]: 10: Hoare triple {42#false} assume !true; {42#false} is VALID [2018-11-14 17:04:16,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2018-11-14 17:04:16,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-14 17:04:16,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {42#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {42#false} is VALID [2018-11-14 17:04:16,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {42#false} assume #t~short9; {42#false} is VALID [2018-11-14 17:04:16,783 INFO L256 TraceCheckUtils]: 15: Hoare triple {42#false} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {42#false} is VALID [2018-11-14 17:04:16,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2018-11-14 17:04:16,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {42#false} assume ~cond == 0; {42#false} is VALID [2018-11-14 17:04:16,784 INFO L273 TraceCheckUtils]: 18: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-14 17:04:16,788 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 17:04:16,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:16,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:04:16,796 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-14 17:04:16,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:16,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:04:16,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:16,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:04:16,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:04:16,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:04:16,908 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-14 17:04:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:17,038 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2018-11-14 17:04:17,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:04:17,039 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-14 17:04:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:04:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2018-11-14 17:04:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:04:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2018-11-14 17:04:17,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 81 transitions. [2018-11-14 17:04:17,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:17,402 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:04:17,405 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:04:17,408 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 17:04:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:04:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 17:04:17,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:17,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 17:04:17,464 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 17:04:17,464 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 17:04:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:17,469 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 17:04:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 17:04:17,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:17,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:17,471 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 17:04:17,471 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 17:04:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:17,476 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 17:04:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 17:04:17,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:17,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:17,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:17,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:04:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-14 17:04:17,483 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 19 [2018-11-14 17:04:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:17,484 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-14 17:04:17,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:04:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 17:04:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:04:17,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:17,485 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:17,486 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:17,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash 195010836, now seen corresponding path program 1 times [2018-11-14 17:04:17,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:17,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:17,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:17,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:17,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:17,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID [2018-11-14 17:04:17,683 INFO L273 TraceCheckUtils]: 1: Hoare triple {226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {226#true} is VALID [2018-11-14 17:04:17,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-14 17:04:17,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} #97#return; {226#true} is VALID [2018-11-14 17:04:17,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {226#true} call #t~ret10 := main(); {226#true} is VALID [2018-11-14 17:04:17,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {226#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {226#true} is VALID [2018-11-14 17:04:17,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {226#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {226#true} is VALID [2018-11-14 17:04:17,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {226#true} is VALID [2018-11-14 17:04:17,687 INFO L273 TraceCheckUtils]: 8: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-14 17:04:17,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {226#true} is VALID [2018-11-14 17:04:17,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {226#true} ~i~0 := 1; {226#true} is VALID [2018-11-14 17:04:17,688 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-14 17:04:17,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {226#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {226#true} is VALID [2018-11-14 17:04:17,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {226#true} ~i~0 := 0; {226#true} is VALID [2018-11-14 17:04:17,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-14 17:04:17,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {226#true} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {226#true} is VALID [2018-11-14 17:04:17,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {226#true} assume #t~short9; {228#|main_#t~short9|} is VALID [2018-11-14 17:04:17,691 INFO L256 TraceCheckUtils]: 17: Hoare triple {228#|main_#t~short9|} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:04:17,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {229#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {230#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:04:17,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {230#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {227#false} is VALID [2018-11-14 17:04:17,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {227#false} assume !false; {227#false} is VALID [2018-11-14 17:04:17,696 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 17:04:17,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:17,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:04:17,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 17:04:17,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:17,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:04:17,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:17,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:04:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:04:17,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:04:17,920 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 5 states. [2018-11-14 17:04:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:18,440 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-14 17:04:18,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:04:18,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 17:04:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:04:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-14 17:04:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:04:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-14 17:04:18,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2018-11-14 17:04:18,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:18,536 INFO L225 Difference]: With dead ends: 40 [2018-11-14 17:04:18,537 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 17:04:18,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:04:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 17:04:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-14 17:04:18,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:18,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2018-11-14 17:04:18,557 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2018-11-14 17:04:18,557 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2018-11-14 17:04:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:18,561 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-14 17:04:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-14 17:04:18,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:18,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:18,562 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2018-11-14 17:04:18,562 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2018-11-14 17:04:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:18,566 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-14 17:04:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-14 17:04:18,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:18,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:18,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:18,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:04:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-14 17:04:18,570 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2018-11-14 17:04:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:18,571 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-14 17:04:18,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:04:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 17:04:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:04:18,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:18,572 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:18,573 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:18,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:18,573 INFO L82 PathProgramCache]: Analyzing trace with hash 196857878, now seen corresponding path program 1 times [2018-11-14 17:04:18,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:18,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:18,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:18,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:18,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:19,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {410#true} call ULTIMATE.init(); {410#true} is VALID [2018-11-14 17:04:19,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {410#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {410#true} is VALID [2018-11-14 17:04:19,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {410#true} assume true; {410#true} is VALID [2018-11-14 17:04:19,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {410#true} {410#true} #97#return; {410#true} is VALID [2018-11-14 17:04:19,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {410#true} call #t~ret10 := main(); {410#true} is VALID [2018-11-14 17:04:19,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {410#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {410#true} is VALID [2018-11-14 17:04:19,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {410#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {412#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 17:04:19,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {412#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {413#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 17:04:19,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {413#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume true; {413#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 17:04:19,037 INFO L273 TraceCheckUtils]: 9: Hoare triple {413#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {411#false} is VALID [2018-11-14 17:04:19,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {411#false} ~i~0 := 1; {411#false} is VALID [2018-11-14 17:04:19,037 INFO L273 TraceCheckUtils]: 11: Hoare triple {411#false} assume true; {411#false} is VALID [2018-11-14 17:04:19,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {411#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {411#false} is VALID [2018-11-14 17:04:19,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {411#false} ~i~0 := 0; {411#false} is VALID [2018-11-14 17:04:19,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {411#false} assume true; {411#false} is VALID [2018-11-14 17:04:19,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {411#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {411#false} is VALID [2018-11-14 17:04:19,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {411#false} assume !#t~short9;call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short9 := #t~mem8 == 0; {411#false} is VALID [2018-11-14 17:04:19,040 INFO L256 TraceCheckUtils]: 17: Hoare triple {411#false} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {411#false} is VALID [2018-11-14 17:04:19,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {411#false} ~cond := #in~cond; {411#false} is VALID [2018-11-14 17:04:19,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {411#false} assume ~cond == 0; {411#false} is VALID [2018-11-14 17:04:19,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {411#false} assume !false; {411#false} is VALID [2018-11-14 17:04:19,042 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 17:04:19,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:19,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:04:19,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 17:04:19,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:19,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:04:19,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:19,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:04:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:04:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:04:19,083 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 4 states. [2018-11-14 17:04:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:19,392 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-14 17:04:19,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:04:19,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 17:04:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:04:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2018-11-14 17:04:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:04:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2018-11-14 17:04:19,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2018-11-14 17:04:19,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:19,571 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:04:19,572 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:04:19,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:04:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:04:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-14 17:04:19,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:19,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 39 states. [2018-11-14 17:04:19,606 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 39 states. [2018-11-14 17:04:19,606 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 39 states. [2018-11-14 17:04:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:19,610 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-14 17:04:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 17:04:19,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:19,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:19,611 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 42 states. [2018-11-14 17:04:19,612 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 42 states. [2018-11-14 17:04:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:19,615 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-14 17:04:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 17:04:19,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:19,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:19,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:19,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:04:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-14 17:04:19,619 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 21 [2018-11-14 17:04:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:19,619 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-14 17:04:19,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:04:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 17:04:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:04:19,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:19,621 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:19,621 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:19,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:19,622 INFO L82 PathProgramCache]: Analyzing trace with hash -799693743, now seen corresponding path program 1 times [2018-11-14 17:04:19,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:19,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:19,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:19,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:19,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:19,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {635#true} call ULTIMATE.init(); {635#true} is VALID [2018-11-14 17:04:19,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {635#true} is VALID [2018-11-14 17:04:19,844 INFO L273 TraceCheckUtils]: 2: Hoare triple {635#true} assume true; {635#true} is VALID [2018-11-14 17:04:19,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {635#true} {635#true} #97#return; {635#true} is VALID [2018-11-14 17:04:19,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {635#true} call #t~ret10 := main(); {635#true} is VALID [2018-11-14 17:04:19,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {635#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {635#true} is VALID [2018-11-14 17:04:19,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {635#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {637#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 17:04:19,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {637#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-14 17:04:19,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} assume true; {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-14 17:04:19,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-14 17:04:19,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - 2) * 4, 4); {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-14 17:04:19,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - 1) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - 1) * 4, 4);havoc #t~mem3; {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-14 17:04:19,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-14 17:04:19,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} assume true; {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-14 17:04:19,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} is VALID [2018-11-14 17:04:19,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {638#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0))} ~i~0 := 1; {639#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 17:04:19,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {639#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume true; {639#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 17:04:19,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {639#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {636#false} is VALID [2018-11-14 17:04:19,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {636#false} ~i~0 := 0; {636#false} is VALID [2018-11-14 17:04:19,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {636#false} assume true; {636#false} is VALID [2018-11-14 17:04:19,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {636#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem7 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short9 := #t~mem7 >= ~MINVAL~0; {636#false} is VALID [2018-11-14 17:04:19,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {636#false} assume !#t~short9;call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short9 := #t~mem8 == 0; {636#false} is VALID [2018-11-14 17:04:19,861 INFO L256 TraceCheckUtils]: 22: Hoare triple {636#false} call __VERIFIER_assert((if #t~short9 then 1 else 0)); {636#false} is VALID [2018-11-14 17:04:19,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {636#false} ~cond := #in~cond; {636#false} is VALID [2018-11-14 17:04:19,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {636#false} assume ~cond == 0; {636#false} is VALID [2018-11-14 17:04:19,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {636#false} assume !false; {636#false} is VALID [2018-11-14 17:04:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:04:19,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:19,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:04:19,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 17:04:19,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:19,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:04:19,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:19,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:04:19,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:04:19,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:04:19,905 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-11-14 17:04:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:20,311 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-14 17:04:20,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:04:20,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 17:04:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:04:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-14 17:04:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:04:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-14 17:04:20,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-14 17:04:20,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:20,510 INFO L225 Difference]: With dead ends: 65 [2018-11-14 17:04:20,510 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 17:04:20,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:04:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 17:04:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-14 17:04:20,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:20,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 41 states. [2018-11-14 17:04:20,562 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 41 states. [2018-11-14 17:04:20,562 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 41 states. [2018-11-14 17:04:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:20,564 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-14 17:04:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-14 17:04:20,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:20,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:20,566 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 47 states. [2018-11-14 17:04:20,566 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 47 states. [2018-11-14 17:04:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:20,569 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-14 17:04:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-14 17:04:20,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:20,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:20,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:20,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:04:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-14 17:04:20,573 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 26 [2018-11-14 17:04:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:20,573 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-14 17:04:20,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:04:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 17:04:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:04:20,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:20,576 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:20,576 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:20,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:20,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1952778374, now seen corresponding path program 1 times [2018-11-14 17:04:20,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:20,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:20,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:21,077 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 20 [2018-11-14 17:04:21,317 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: select-over-store with same index should have been removed at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:68) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) 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 17:04:21,322 INFO L168 Benchmark]: Toolchain (without parser) took 6276.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -465.4 MB). Peak memory consumption was 286.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:04:21,324 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:04:21,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.83 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:04:21,326 INFO L168 Benchmark]: Boogie Preprocessor took 53.68 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 17:04:21,326 INFO L168 Benchmark]: RCFGBuilder took 915.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:04:21,328 INFO L168 Benchmark]: TraceAbstraction took 4920.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 293.6 MB). Peak memory consumption was 293.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:04:21,332 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.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 381.83 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.68 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 915.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4920.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 293.6 MB). Peak memory consumption was 293.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: select-over-store with same index should have been removed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: select-over-store with same index should have been removed: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:68) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...