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/loops/eureka_01_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:29:18,988 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:29:18,990 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:29:19,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:29:19,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:29:19,003 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:29:19,005 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:29:19,007 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:29:19,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:29:19,009 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:29:19,010 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:29:19,010 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:29:19,011 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:29:19,012 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:29:19,013 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:29:19,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:29:19,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:29:19,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:29:19,019 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:29:19,021 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:29:19,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:29:19,024 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:29:19,026 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:29:19,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:29:19,027 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:29:19,028 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:29:19,029 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:29:19,030 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:29:19,031 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:29:19,032 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:29:19,032 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:29:19,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:29:19,033 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:29:19,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:29:19,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:29:19,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:29:19,036 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:29:19,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:29:19,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:29:19,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:29:19,053 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:29:19,054 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:29:19,054 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:29:19,054 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:29:19,055 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:29:19,055 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:29:19,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:29:19,055 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:29:19,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:29:19,056 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:29:19,056 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:29:19,056 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:29:19,056 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:29:19,057 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:29:19,057 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:29:19,057 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:29:19,057 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:29:19,058 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:29:19,058 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:29:19,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:29:19,058 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:29:19,058 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:29:19,059 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:29:19,059 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:29:19,059 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:29:19,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:29:19,060 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:29:19,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:29:19,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:29:19,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:29:19,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:29:19,134 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:29:19,135 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01_false-unreach-call_true-termination.i [2018-11-14 17:29:19,193 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4107cc43/fa065cb71361443582eab986f2014880/FLAG1948e8955 [2018-11-14 17:29:19,628 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:29:19,629 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_false-unreach-call_true-termination.i [2018-11-14 17:29:19,644 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4107cc43/fa065cb71361443582eab986f2014880/FLAG1948e8955 [2018-11-14 17:29:19,659 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4107cc43/fa065cb71361443582eab986f2014880 [2018-11-14 17:29:19,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:29:19,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:29:19,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:29:19,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:29:19,675 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:29:19,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:29:19" (1/1) ... [2018-11-14 17:29:19,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b033d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:19, skipping insertion in model container [2018-11-14 17:29:19,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:29:19" (1/1) ... [2018-11-14 17:29:19,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:29:19,725 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:29:20,012 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:29:20,017 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:29:20,065 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:29:20,102 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:29:20,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:20 WrapperNode [2018-11-14 17:29:20,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:29:20,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:29:20,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:29:20,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:29:20,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:20" (1/1) ... [2018-11-14 17:29:20,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:20" (1/1) ... [2018-11-14 17:29:20,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:20" (1/1) ... [2018-11-14 17:29:20,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:20" (1/1) ... [2018-11-14 17:29:20,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:20" (1/1) ... [2018-11-14 17:29:20,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:20" (1/1) ... [2018-11-14 17:29:20,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:20" (1/1) ... [2018-11-14 17:29:20,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:29:20,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:29:20,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:29:20,184 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:29:20,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:20" (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:29:20,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:29:20,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:29:20,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:29:20,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:29:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:29:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:29:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:29:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:29:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:29:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:29:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:29:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:29:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:29:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:29:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:29:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:29:21,590 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:29:21,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:29:21 BoogieIcfgContainer [2018-11-14 17:29:21,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:29:21,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:29:21,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:29:21,595 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:29:21,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:29:19" (1/3) ... [2018-11-14 17:29:21,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572459df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:29:21, skipping insertion in model container [2018-11-14 17:29:21,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:20" (2/3) ... [2018-11-14 17:29:21,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572459df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:29:21, skipping insertion in model container [2018-11-14 17:29:21,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:29:21" (3/3) ... [2018-11-14 17:29:21,599 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_false-unreach-call_true-termination.i [2018-11-14 17:29:21,609 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:29:21,618 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:29:21,632 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:29:21,664 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:29:21,665 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:29:21,665 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:29:21,665 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:29:21,665 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:29:21,666 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:29:21,666 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:29:21,666 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:29:21,666 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:29:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 17:29:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:29:21,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:21,693 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] [2018-11-14 17:29:21,696 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:21,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1712099597, now seen corresponding path program 1 times [2018-11-14 17:29:21,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:21,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:21,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:21,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 17:29:21,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {45#true} is VALID [2018-11-14 17:29:21,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 17:29:21,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #116#return; {45#true} is VALID [2018-11-14 17:29:21,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret19 := main(); {45#true} is VALID [2018-11-14 17:29:21,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {45#true} is VALID [2018-11-14 17:29:21,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {45#true} is VALID [2018-11-14 17:29:21,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {45#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {45#true} is VALID [2018-11-14 17:29:21,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 17:29:21,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-14 17:29:21,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 17:29:21,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-14 17:29:21,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 17:29:21,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} ~i~0 := 0; {46#false} is VALID [2018-11-14 17:29:21,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 17:29:21,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {46#false} is VALID [2018-11-14 17:29:21,985 INFO L256 TraceCheckUtils]: 16: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {46#false} is VALID [2018-11-14 17:29:21,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-14 17:29:21,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {46#false} assume ~cond == 0; {46#false} is VALID [2018-11-14 17:29:21,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 17:29:21,990 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:29:21,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:29:21,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:29:21,998 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 17:29:22,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:22,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:29:22,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:22,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:29:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:29:22,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:29:22,145 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 17:29:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:22,418 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2018-11-14 17:29:22,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:29:22,418 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 17:29:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:29:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 17:29:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:29:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 17:29:22,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2018-11-14 17:29:22,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:22,936 INFO L225 Difference]: With dead ends: 72 [2018-11-14 17:29:22,936 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:29:22,940 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:29:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:29:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 17:29:23,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:23,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 17:29:23,028 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:29:23,028 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:29:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:23,034 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-14 17:29:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-14 17:29:23,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:23,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:23,035 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:29:23,036 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:29:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:23,044 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-14 17:29:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-14 17:29:23,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:23,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:23,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:23,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:29:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-14 17:29:23,053 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 20 [2018-11-14 17:29:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:23,053 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-14 17:29:23,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:29:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-14 17:29:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:29:23,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:23,056 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, 1, 1] [2018-11-14 17:29:23,057 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:23,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2129412844, now seen corresponding path program 1 times [2018-11-14 17:29:23,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:23,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:23,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:23,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:23,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:23,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {260#true} is VALID [2018-11-14 17:29:23,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {260#true} is VALID [2018-11-14 17:29:23,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2018-11-14 17:29:23,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} #116#return; {260#true} is VALID [2018-11-14 17:29:23,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {260#true} call #t~ret19 := main(); {260#true} is VALID [2018-11-14 17:29:23,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {260#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {260#true} is VALID [2018-11-14 17:29:23,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {260#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {260#true} is VALID [2018-11-14 17:29:23,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {260#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {262#(= main_~i~0 0)} is VALID [2018-11-14 17:29:23,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {262#(= main_~i~0 0)} assume true; {262#(= main_~i~0 0)} is VALID [2018-11-14 17:29:23,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {262#(= main_~i~0 0)} assume !(~i~0 < ~nodecount~0); {263#(<= main_~nodecount~0 0)} is VALID [2018-11-14 17:29:23,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {263#(<= main_~nodecount~0 0)} ~i~0 := 0; {263#(<= main_~nodecount~0 0)} is VALID [2018-11-14 17:29:23,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {263#(<= main_~nodecount~0 0)} assume true; {263#(<= main_~nodecount~0 0)} is VALID [2018-11-14 17:29:23,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {263#(<= main_~nodecount~0 0)} assume !(~i~0 < ~nodecount~0); {263#(<= main_~nodecount~0 0)} is VALID [2018-11-14 17:29:23,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {263#(<= main_~nodecount~0 0)} ~i~0 := 0; {263#(<= main_~nodecount~0 0)} is VALID [2018-11-14 17:29:23,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {263#(<= main_~nodecount~0 0)} assume true; {263#(<= main_~nodecount~0 0)} is VALID [2018-11-14 17:29:23,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {263#(<= main_~nodecount~0 0)} assume !(~i~0 < ~edgecount~0); {263#(<= main_~nodecount~0 0)} is VALID [2018-11-14 17:29:23,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {263#(<= main_~nodecount~0 0)} ~i~0 := 0; {264#(and (<= main_~nodecount~0 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:23,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {264#(and (<= main_~nodecount~0 0) (= main_~i~0 0))} assume true; {264#(and (<= main_~nodecount~0 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:23,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {264#(and (<= main_~nodecount~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {261#false} is VALID [2018-11-14 17:29:23,325 INFO L256 TraceCheckUtils]: 19: Hoare triple {261#false} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {261#false} is VALID [2018-11-14 17:29:23,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {261#false} ~cond := #in~cond; {261#false} is VALID [2018-11-14 17:29:23,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {261#false} assume ~cond == 0; {261#false} is VALID [2018-11-14 17:29:23,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {261#false} assume !false; {261#false} is VALID [2018-11-14 17:29:23,330 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:29:23,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:29:23,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:29:23,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-14 17:29:23,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:23,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:29:23,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:23,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:29:23,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:29:23,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:29:23,420 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 5 states. [2018-11-14 17:29:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:23,949 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-11-14 17:29:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:29:23,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-14 17:29:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:29:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2018-11-14 17:29:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:29:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2018-11-14 17:29:23,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 118 transitions. [2018-11-14 17:29:24,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:24,220 INFO L225 Difference]: With dead ends: 98 [2018-11-14 17:29:24,221 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:29:24,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:29:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:29:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2018-11-14 17:29:24,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:24,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 41 states. [2018-11-14 17:29:24,245 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 41 states. [2018-11-14 17:29:24,245 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 41 states. [2018-11-14 17:29:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:24,250 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 17:29:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 17:29:24,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:24,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:24,252 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 58 states. [2018-11-14 17:29:24,252 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 58 states. [2018-11-14 17:29:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:24,257 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 17:29:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 17:29:24,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:24,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:24,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:24,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:29:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-14 17:29:24,261 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 23 [2018-11-14 17:29:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:24,262 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-14 17:29:24,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:29:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-14 17:29:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:29:24,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:24,264 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, 1] [2018-11-14 17:29:24,264 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:24,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1380519553, now seen corresponding path program 1 times [2018-11-14 17:29:24,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:24,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:24,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:24,739 INFO L256 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {562#true} is VALID [2018-11-14 17:29:24,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {562#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {562#true} is VALID [2018-11-14 17:29:24,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2018-11-14 17:29:24,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #116#return; {562#true} is VALID [2018-11-14 17:29:24,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret19 := main(); {562#true} is VALID [2018-11-14 17:29:24,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {562#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {562#true} is VALID [2018-11-14 17:29:24,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {562#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {562#true} is VALID [2018-11-14 17:29:24,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {562#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:24,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume true; {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:24,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:24,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {565#(and (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:29:24,755 INFO L273 TraceCheckUtils]: 11: Hoare triple {565#(and (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,756 INFO L273 TraceCheckUtils]: 12: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} ~i~0 := 0; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,759 INFO L273 TraceCheckUtils]: 15: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} ~i~0 := 0; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,777 INFO L273 TraceCheckUtils]: 23: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,779 INFO L273 TraceCheckUtils]: 24: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !(~i~0 < ~edgecount~0); {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:24,779 INFO L273 TraceCheckUtils]: 25: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} ~i~0 := 0; {565#(and (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:29:24,781 INFO L273 TraceCheckUtils]: 26: Hoare triple {565#(and (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} assume true; {565#(and (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:29:24,782 INFO L273 TraceCheckUtils]: 27: Hoare triple {565#(and (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {567#(= |main_#t~mem18| 0)} is VALID [2018-11-14 17:29:24,783 INFO L256 TraceCheckUtils]: 28: Hoare triple {567#(= |main_#t~mem18| 0)} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {568#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:29:24,784 INFO L273 TraceCheckUtils]: 29: Hoare triple {568#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {569#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:29:24,785 INFO L273 TraceCheckUtils]: 30: Hoare triple {569#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {563#false} is VALID [2018-11-14 17:29:24,785 INFO L273 TraceCheckUtils]: 31: Hoare triple {563#false} assume !false; {563#false} is VALID [2018-11-14 17:29:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:29:24,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:24,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:29:24,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:24,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:25,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:29:25,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:29:25,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:25,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:25,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:25,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 17:29:25,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 17:29:25,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:29:25,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:25,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:25,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:25,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 17:29:25,614 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:29:25,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {562#true} is VALID [2018-11-14 17:29:25,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {562#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {562#true} is VALID [2018-11-14 17:29:25,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2018-11-14 17:29:25,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #116#return; {562#true} is VALID [2018-11-14 17:29:25,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret19 := main(); {562#true} is VALID [2018-11-14 17:29:25,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {562#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {562#true} is VALID [2018-11-14 17:29:25,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {562#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {562#true} is VALID [2018-11-14 17:29:25,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {562#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:25,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume true; {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:25,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:25,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {564#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} ~i~0 := 0; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,863 INFO L273 TraceCheckUtils]: 18: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,863 INFO L273 TraceCheckUtils]: 19: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} ~i~0 := 0; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,866 INFO L273 TraceCheckUtils]: 24: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !(~i~0 < ~edgecount~0); {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:25,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {566#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} ~i~0 := 0; {565#(and (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:29:25,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {565#(and (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} assume true; {565#(and (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:29:25,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {565#(and (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {654#(<= 0 |main_#t~mem18|)} is VALID [2018-11-14 17:29:25,874 INFO L256 TraceCheckUtils]: 28: Hoare triple {654#(<= 0 |main_#t~mem18|)} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {568#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:29:25,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {568#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {569#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:29:25,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {569#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {563#false} is VALID [2018-11-14 17:29:25,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {563#false} assume !false; {563#false} is VALID [2018-11-14 17:29:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:29:25,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:29:25,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 17:29:25,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-14 17:29:25,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:25,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:29:25,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:25,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:29:25,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:29:25,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:29:25,973 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 9 states. [2018-11-14 17:29:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:27,175 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2018-11-14 17:29:27,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:29:27,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-14 17:29:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:29:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2018-11-14 17:29:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:29:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2018-11-14 17:29:27,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 112 transitions. [2018-11-14 17:29:27,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:27,387 INFO L225 Difference]: With dead ends: 95 [2018-11-14 17:29:27,387 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 17:29:27,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:29:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 17:29:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2018-11-14 17:29:27,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:27,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 68 states. [2018-11-14 17:29:27,453 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 68 states. [2018-11-14 17:29:27,454 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 68 states. [2018-11-14 17:29:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:27,458 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-11-14 17:29:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2018-11-14 17:29:27,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:27,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:27,460 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 93 states. [2018-11-14 17:29:27,460 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 93 states. [2018-11-14 17:29:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:27,466 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-11-14 17:29:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2018-11-14 17:29:27,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:27,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:27,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:27,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:29:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2018-11-14 17:29:27,472 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 32 [2018-11-14 17:29:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:27,472 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-11-14 17:29:27,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:29:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2018-11-14 17:29:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:29:27,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:27,474 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, 1] [2018-11-14 17:29:27,475 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:27,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1599374271, now seen corresponding path program 1 times [2018-11-14 17:29:27,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:27,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:27,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:27,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:27,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2018-11-14 17:29:27,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {1066#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1066#true} is VALID [2018-11-14 17:29:27,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {1066#true} assume true; {1066#true} is VALID [2018-11-14 17:29:27,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1066#true} {1066#true} #116#return; {1066#true} is VALID [2018-11-14 17:29:27,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {1066#true} call #t~ret19 := main(); {1066#true} is VALID [2018-11-14 17:29:27,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {1066#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {1066#true} is VALID [2018-11-14 17:29:27,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {1066#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {1066#true} is VALID [2018-11-14 17:29:27,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {1066#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1068#(= main_~i~0 main_~source~0)} is VALID [2018-11-14 17:29:27,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {1068#(= main_~i~0 main_~source~0)} assume true; {1068#(= main_~i~0 main_~source~0)} is VALID [2018-11-14 17:29:27,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {1068#(= main_~i~0 main_~source~0)} assume !!(~i~0 < ~nodecount~0); {1068#(= main_~i~0 main_~source~0)} is VALID [2018-11-14 17:29:27,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {1068#(= main_~i~0 main_~source~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1067#false} is VALID [2018-11-14 17:29:27,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {1067#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1067#false} is VALID [2018-11-14 17:29:27,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {1067#false} assume true; {1067#false} is VALID [2018-11-14 17:29:27,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {1067#false} assume !(~i~0 < ~nodecount~0); {1067#false} is VALID [2018-11-14 17:29:27,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {1067#false} ~i~0 := 0; {1067#false} is VALID [2018-11-14 17:29:27,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {1067#false} assume true; {1067#false} is VALID [2018-11-14 17:29:27,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {1067#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1067#false} is VALID [2018-11-14 17:29:27,566 INFO L273 TraceCheckUtils]: 17: Hoare triple {1067#false} assume true; {1067#false} is VALID [2018-11-14 17:29:27,567 INFO L273 TraceCheckUtils]: 18: Hoare triple {1067#false} assume !(~j~0 < ~edgecount~0); {1067#false} is VALID [2018-11-14 17:29:27,567 INFO L273 TraceCheckUtils]: 19: Hoare triple {1067#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1067#false} is VALID [2018-11-14 17:29:27,567 INFO L273 TraceCheckUtils]: 20: Hoare triple {1067#false} assume true; {1067#false} is VALID [2018-11-14 17:29:27,568 INFO L273 TraceCheckUtils]: 21: Hoare triple {1067#false} assume !(~i~0 < ~nodecount~0); {1067#false} is VALID [2018-11-14 17:29:27,568 INFO L273 TraceCheckUtils]: 22: Hoare triple {1067#false} ~i~0 := 0; {1067#false} is VALID [2018-11-14 17:29:27,568 INFO L273 TraceCheckUtils]: 23: Hoare triple {1067#false} assume true; {1067#false} is VALID [2018-11-14 17:29:27,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {1067#false} assume !(~i~0 < ~edgecount~0); {1067#false} is VALID [2018-11-14 17:29:27,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {1067#false} ~i~0 := 0; {1067#false} is VALID [2018-11-14 17:29:27,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {1067#false} assume true; {1067#false} is VALID [2018-11-14 17:29:27,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {1067#false} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1067#false} is VALID [2018-11-14 17:29:27,570 INFO L256 TraceCheckUtils]: 28: Hoare triple {1067#false} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {1067#false} is VALID [2018-11-14 17:29:27,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2018-11-14 17:29:27,570 INFO L273 TraceCheckUtils]: 30: Hoare triple {1067#false} assume ~cond == 0; {1067#false} is VALID [2018-11-14 17:29:27,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2018-11-14 17:29:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:29:27,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:29:27,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:29:27,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 17:29:27,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:27,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:29:27,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:27,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:29:27,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:29:27,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:29:27,648 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 3 states. [2018-11-14 17:29:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:27,805 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2018-11-14 17:29:27,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:29:27,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 17:29:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:29:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-14 17:29:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:29:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-14 17:29:27,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2018-11-14 17:29:27,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:27,944 INFO L225 Difference]: With dead ends: 101 [2018-11-14 17:29:27,944 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 17:29:27,945 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 17:29:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 17:29:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-14 17:29:28,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:28,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-14 17:29:28,042 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-14 17:29:28,043 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-14 17:29:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:28,047 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-14 17:29:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-11-14 17:29:28,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:28,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:28,048 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-14 17:29:28,048 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-14 17:29:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:28,052 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-14 17:29:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-11-14 17:29:28,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:28,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:28,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:28,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 17:29:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2018-11-14 17:29:28,059 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 32 [2018-11-14 17:29:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:28,060 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2018-11-14 17:29:28,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:29:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2018-11-14 17:29:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:29:28,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:28,063 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2018-11-14 17:29:28,063 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:28,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash 758656664, now seen corresponding path program 1 times [2018-11-14 17:29:28,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:28,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:28,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {1431#true} call ULTIMATE.init(); {1431#true} is VALID [2018-11-14 17:29:28,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {1431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1431#true} is VALID [2018-11-14 17:29:28,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-14 17:29:28,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1431#true} {1431#true} #116#return; {1431#true} is VALID [2018-11-14 17:29:28,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {1431#true} call #t~ret19 := main(); {1431#true} is VALID [2018-11-14 17:29:28,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {1431#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {1431#true} is VALID [2018-11-14 17:29:28,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {1431#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {1431#true} is VALID [2018-11-14 17:29:28,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {1431#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1431#true} is VALID [2018-11-14 17:29:28,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-14 17:29:28,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {1431#true} assume !!(~i~0 < ~nodecount~0); {1431#true} is VALID [2018-11-14 17:29:28,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {1431#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1431#true} is VALID [2018-11-14 17:29:28,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {1431#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1431#true} is VALID [2018-11-14 17:29:28,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-14 17:29:28,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {1431#true} assume !(~i~0 < ~nodecount~0); {1431#true} is VALID [2018-11-14 17:29:28,240 INFO L273 TraceCheckUtils]: 14: Hoare triple {1431#true} ~i~0 := 0; {1431#true} is VALID [2018-11-14 17:29:28,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-14 17:29:28,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {1431#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1433#(= main_~j~0 0)} is VALID [2018-11-14 17:29:28,244 INFO L273 TraceCheckUtils]: 17: Hoare triple {1433#(= main_~j~0 0)} assume true; {1433#(= main_~j~0 0)} is VALID [2018-11-14 17:29:28,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {1433#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem6 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem7;havoc #t~mem7;call #t~mem10 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem8 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem9 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {1434#(and (<= (+ main_~j~0 1) main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-14 17:29:28,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {1434#(and (<= (+ main_~j~0 1) main_~edgecount~0) (= main_~j~0 0))} assume #t~mem10 > #t~mem8 + #t~mem9;havoc #t~mem8;havoc #t~mem9;havoc #t~mem10;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4); {1434#(and (<= (+ main_~j~0 1) main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-14 17:29:28,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {1434#(and (<= (+ main_~j~0 1) main_~edgecount~0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := #t~post5 + 1;havoc #t~post5; {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {1435#(<= 1 main_~edgecount~0)} assume true; {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,251 INFO L273 TraceCheckUtils]: 22: Hoare triple {1435#(<= 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {1435#(<= 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {1435#(<= 1 main_~edgecount~0)} assume true; {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {1435#(<= 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {1435#(<= 1 main_~edgecount~0)} ~i~0 := 0; {1436#(and (<= 1 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:28,257 INFO L273 TraceCheckUtils]: 27: Hoare triple {1436#(and (<= 1 main_~edgecount~0) (= main_~i~0 0))} assume true; {1436#(and (<= 1 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:28,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {1436#(and (<= 1 main_~edgecount~0) (= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {1432#false} is VALID [2018-11-14 17:29:28,258 INFO L273 TraceCheckUtils]: 29: Hoare triple {1432#false} ~i~0 := 0; {1432#false} is VALID [2018-11-14 17:29:28,258 INFO L273 TraceCheckUtils]: 30: Hoare triple {1432#false} assume true; {1432#false} is VALID [2018-11-14 17:29:28,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {1432#false} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1432#false} is VALID [2018-11-14 17:29:28,259 INFO L256 TraceCheckUtils]: 32: Hoare triple {1432#false} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {1432#false} is VALID [2018-11-14 17:29:28,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {1432#false} ~cond := #in~cond; {1432#false} is VALID [2018-11-14 17:29:28,260 INFO L273 TraceCheckUtils]: 34: Hoare triple {1432#false} assume ~cond == 0; {1432#false} is VALID [2018-11-14 17:29:28,260 INFO L273 TraceCheckUtils]: 35: Hoare triple {1432#false} assume !false; {1432#false} is VALID [2018-11-14 17:29:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:29:28,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:28,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:29:28,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:28,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:28,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {1431#true} call ULTIMATE.init(); {1431#true} is VALID [2018-11-14 17:29:28,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {1431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1431#true} is VALID [2018-11-14 17:29:28,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-14 17:29:28,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1431#true} {1431#true} #116#return; {1431#true} is VALID [2018-11-14 17:29:28,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {1431#true} call #t~ret19 := main(); {1431#true} is VALID [2018-11-14 17:29:28,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {1431#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {1431#true} is VALID [2018-11-14 17:29:28,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {1431#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {1431#true} is VALID [2018-11-14 17:29:28,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {1431#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1431#true} is VALID [2018-11-14 17:29:28,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-14 17:29:28,445 INFO L273 TraceCheckUtils]: 9: Hoare triple {1431#true} assume !!(~i~0 < ~nodecount~0); {1431#true} is VALID [2018-11-14 17:29:28,445 INFO L273 TraceCheckUtils]: 10: Hoare triple {1431#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1431#true} is VALID [2018-11-14 17:29:28,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {1431#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1431#true} is VALID [2018-11-14 17:29:28,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-14 17:29:28,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {1431#true} assume !(~i~0 < ~nodecount~0); {1431#true} is VALID [2018-11-14 17:29:28,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {1431#true} ~i~0 := 0; {1431#true} is VALID [2018-11-14 17:29:28,446 INFO L273 TraceCheckUtils]: 15: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-14 17:29:28,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {1431#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1488#(<= 0 main_~j~0)} is VALID [2018-11-14 17:29:28,454 INFO L273 TraceCheckUtils]: 17: Hoare triple {1488#(<= 0 main_~j~0)} assume true; {1488#(<= 0 main_~j~0)} is VALID [2018-11-14 17:29:28,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {1488#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem6 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem7;havoc #t~mem7;call #t~mem10 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem8 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem9 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {1435#(<= 1 main_~edgecount~0)} assume #t~mem10 > #t~mem8 + #t~mem9;havoc #t~mem8;havoc #t~mem9;havoc #t~mem10;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4); {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {1435#(<= 1 main_~edgecount~0)} #t~post5 := ~j~0;~j~0 := #t~post5 + 1;havoc #t~post5; {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {1435#(<= 1 main_~edgecount~0)} assume true; {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {1435#(<= 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {1435#(<= 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,481 INFO L273 TraceCheckUtils]: 24: Hoare triple {1435#(<= 1 main_~edgecount~0)} assume true; {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,481 INFO L273 TraceCheckUtils]: 25: Hoare triple {1435#(<= 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1435#(<= 1 main_~edgecount~0)} is VALID [2018-11-14 17:29:28,483 INFO L273 TraceCheckUtils]: 26: Hoare triple {1435#(<= 1 main_~edgecount~0)} ~i~0 := 0; {1519#(and (<= 1 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:29:28,483 INFO L273 TraceCheckUtils]: 27: Hoare triple {1519#(and (<= 1 main_~edgecount~0) (<= main_~i~0 0))} assume true; {1519#(and (<= 1 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:29:28,485 INFO L273 TraceCheckUtils]: 28: Hoare triple {1519#(and (<= 1 main_~edgecount~0) (<= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {1432#false} is VALID [2018-11-14 17:29:28,485 INFO L273 TraceCheckUtils]: 29: Hoare triple {1432#false} ~i~0 := 0; {1432#false} is VALID [2018-11-14 17:29:28,486 INFO L273 TraceCheckUtils]: 30: Hoare triple {1432#false} assume true; {1432#false} is VALID [2018-11-14 17:29:28,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {1432#false} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {1432#false} is VALID [2018-11-14 17:29:28,487 INFO L256 TraceCheckUtils]: 32: Hoare triple {1432#false} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {1432#false} is VALID [2018-11-14 17:29:28,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {1432#false} ~cond := #in~cond; {1432#false} is VALID [2018-11-14 17:29:28,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {1432#false} assume ~cond == 0; {1432#false} is VALID [2018-11-14 17:29:28,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {1432#false} assume !false; {1432#false} is VALID [2018-11-14 17:29:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:29:28,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:29:28,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-14 17:29:28,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-11-14 17:29:28,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:28,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:29:28,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:28,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:29:28,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:29:28,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:29:28,562 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand 8 states. [2018-11-14 17:29:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:29,243 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2018-11-14 17:29:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:29:29,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-11-14 17:29:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:29:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2018-11-14 17:29:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:29:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2018-11-14 17:29:29,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2018-11-14 17:29:29,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:29,586 INFO L225 Difference]: With dead ends: 164 [2018-11-14 17:29:29,586 INFO L226 Difference]: Without dead ends: 120 [2018-11-14 17:29:29,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:29:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-14 17:29:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 89. [2018-11-14 17:29:29,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:29,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 89 states. [2018-11-14 17:29:29,666 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 89 states. [2018-11-14 17:29:29,666 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 89 states. [2018-11-14 17:29:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:29,672 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2018-11-14 17:29:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2018-11-14 17:29:29,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:29,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:29,673 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 120 states. [2018-11-14 17:29:29,674 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 120 states. [2018-11-14 17:29:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:29,679 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2018-11-14 17:29:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2018-11-14 17:29:29,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:29,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:29,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:29,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 17:29:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-11-14 17:29:29,683 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 36 [2018-11-14 17:29:29,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:29,684 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-11-14 17:29:29,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:29:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-11-14 17:29:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:29:29,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:29,685 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 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:29:29,685 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:29,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:29,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1827534408, now seen corresponding path program 1 times [2018-11-14 17:29:29,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:29,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:29,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:29,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:29,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:29,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {2122#true} call ULTIMATE.init(); {2122#true} is VALID [2018-11-14 17:29:29,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {2122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2122#true} is VALID [2018-11-14 17:29:29,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {2122#true} assume true; {2122#true} is VALID [2018-11-14 17:29:29,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2122#true} {2122#true} #116#return; {2122#true} is VALID [2018-11-14 17:29:29,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {2122#true} call #t~ret19 := main(); {2122#true} is VALID [2018-11-14 17:29:29,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {2122#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {2122#true} is VALID [2018-11-14 17:29:29,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {2122#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {2122#true} is VALID [2018-11-14 17:29:29,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {2122#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2124#(= main_~i~0 0)} is VALID [2018-11-14 17:29:29,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {2124#(= main_~i~0 0)} assume true; {2124#(= main_~i~0 0)} is VALID [2018-11-14 17:29:29,923 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {2124#(= main_~i~0 0)} is VALID [2018-11-14 17:29:29,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {2124#(= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2124#(= main_~i~0 0)} is VALID [2018-11-14 17:29:29,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {2124#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2125#(<= 1 main_~i~0)} is VALID [2018-11-14 17:29:29,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= 1 main_~i~0)} assume true; {2125#(<= 1 main_~i~0)} is VALID [2018-11-14 17:29:29,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= 1 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {2126#(<= 2 main_~nodecount~0)} is VALID [2018-11-14 17:29:29,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {2126#(<= 2 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2126#(<= 2 main_~nodecount~0)} is VALID [2018-11-14 17:29:29,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= 2 main_~nodecount~0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2126#(<= 2 main_~nodecount~0)} is VALID [2018-11-14 17:29:29,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= 2 main_~nodecount~0)} assume true; {2126#(<= 2 main_~nodecount~0)} is VALID [2018-11-14 17:29:29,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= 2 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2126#(<= 2 main_~nodecount~0)} is VALID [2018-11-14 17:29:29,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {2126#(<= 2 main_~nodecount~0)} ~i~0 := 0; {2127#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:29,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} assume true; {2127#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:29,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {2127#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2127#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:29,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {2127#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} assume true; {2127#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:29,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {2127#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {2127#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:29,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {2127#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2128#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-14 17:29:29,931 INFO L273 TraceCheckUtils]: 24: Hoare triple {2128#(<= (+ main_~i~0 1) main_~nodecount~0)} assume true; {2128#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-14 17:29:29,932 INFO L273 TraceCheckUtils]: 25: Hoare triple {2128#(<= (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2123#false} is VALID [2018-11-14 17:29:29,932 INFO L273 TraceCheckUtils]: 26: Hoare triple {2123#false} ~i~0 := 0; {2123#false} is VALID [2018-11-14 17:29:29,932 INFO L273 TraceCheckUtils]: 27: Hoare triple {2123#false} assume true; {2123#false} is VALID [2018-11-14 17:29:29,933 INFO L273 TraceCheckUtils]: 28: Hoare triple {2123#false} assume !(~i~0 < ~edgecount~0); {2123#false} is VALID [2018-11-14 17:29:29,933 INFO L273 TraceCheckUtils]: 29: Hoare triple {2123#false} ~i~0 := 0; {2123#false} is VALID [2018-11-14 17:29:29,933 INFO L273 TraceCheckUtils]: 30: Hoare triple {2123#false} assume true; {2123#false} is VALID [2018-11-14 17:29:29,933 INFO L273 TraceCheckUtils]: 31: Hoare triple {2123#false} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2123#false} is VALID [2018-11-14 17:29:29,934 INFO L256 TraceCheckUtils]: 32: Hoare triple {2123#false} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {2123#false} is VALID [2018-11-14 17:29:29,934 INFO L273 TraceCheckUtils]: 33: Hoare triple {2123#false} ~cond := #in~cond; {2123#false} is VALID [2018-11-14 17:29:29,934 INFO L273 TraceCheckUtils]: 34: Hoare triple {2123#false} assume ~cond == 0; {2123#false} is VALID [2018-11-14 17:29:29,934 INFO L273 TraceCheckUtils]: 35: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2018-11-14 17:29:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:29,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:29,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:29:29,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:30,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:30,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {2122#true} call ULTIMATE.init(); {2122#true} is VALID [2018-11-14 17:29:30,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {2122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2122#true} is VALID [2018-11-14 17:29:30,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {2122#true} assume true; {2122#true} is VALID [2018-11-14 17:29:30,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2122#true} {2122#true} #116#return; {2122#true} is VALID [2018-11-14 17:29:30,357 INFO L256 TraceCheckUtils]: 4: Hoare triple {2122#true} call #t~ret19 := main(); {2122#true} is VALID [2018-11-14 17:29:30,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {2122#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {2122#true} is VALID [2018-11-14 17:29:30,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {2122#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {2122#true} is VALID [2018-11-14 17:29:30,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {2122#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2153#(<= 0 main_~i~0)} is VALID [2018-11-14 17:29:30,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {2153#(<= 0 main_~i~0)} assume true; {2153#(<= 0 main_~i~0)} is VALID [2018-11-14 17:29:30,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {2153#(<= 0 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {2153#(<= 0 main_~i~0)} is VALID [2018-11-14 17:29:30,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {2153#(<= 0 main_~i~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2153#(<= 0 main_~i~0)} is VALID [2018-11-14 17:29:30,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {2153#(<= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2125#(<= 1 main_~i~0)} is VALID [2018-11-14 17:29:30,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= 1 main_~i~0)} assume true; {2125#(<= 1 main_~i~0)} is VALID [2018-11-14 17:29:30,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= 1 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {2126#(<= 2 main_~nodecount~0)} is VALID [2018-11-14 17:29:30,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {2126#(<= 2 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2126#(<= 2 main_~nodecount~0)} is VALID [2018-11-14 17:29:30,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= 2 main_~nodecount~0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2126#(<= 2 main_~nodecount~0)} is VALID [2018-11-14 17:29:30,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= 2 main_~nodecount~0)} assume true; {2126#(<= 2 main_~nodecount~0)} is VALID [2018-11-14 17:29:30,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= 2 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2126#(<= 2 main_~nodecount~0)} is VALID [2018-11-14 17:29:30,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {2126#(<= 2 main_~nodecount~0)} ~i~0 := 0; {2187#(and (<= 2 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:29:30,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {2187#(and (<= 2 main_~nodecount~0) (<= main_~i~0 0))} assume true; {2187#(and (<= 2 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:29:30,382 INFO L273 TraceCheckUtils]: 20: Hoare triple {2187#(and (<= 2 main_~nodecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2187#(and (<= 2 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:29:30,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {2187#(and (<= 2 main_~nodecount~0) (<= main_~i~0 0))} assume true; {2187#(and (<= 2 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:29:30,383 INFO L273 TraceCheckUtils]: 22: Hoare triple {2187#(and (<= 2 main_~nodecount~0) (<= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {2187#(and (<= 2 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:29:30,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {2187#(and (<= 2 main_~nodecount~0) (<= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2203#(and (<= 2 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 17:29:30,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {2203#(and (<= 2 main_~nodecount~0) (<= main_~i~0 1))} assume true; {2203#(and (<= 2 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-14 17:29:30,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {2203#(and (<= 2 main_~nodecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~nodecount~0); {2123#false} is VALID [2018-11-14 17:29:30,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {2123#false} ~i~0 := 0; {2123#false} is VALID [2018-11-14 17:29:30,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {2123#false} assume true; {2123#false} is VALID [2018-11-14 17:29:30,403 INFO L273 TraceCheckUtils]: 28: Hoare triple {2123#false} assume !(~i~0 < ~edgecount~0); {2123#false} is VALID [2018-11-14 17:29:30,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {2123#false} ~i~0 := 0; {2123#false} is VALID [2018-11-14 17:29:30,404 INFO L273 TraceCheckUtils]: 30: Hoare triple {2123#false} assume true; {2123#false} is VALID [2018-11-14 17:29:30,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {2123#false} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {2123#false} is VALID [2018-11-14 17:29:30,404 INFO L256 TraceCheckUtils]: 32: Hoare triple {2123#false} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {2123#false} is VALID [2018-11-14 17:29:30,404 INFO L273 TraceCheckUtils]: 33: Hoare triple {2123#false} ~cond := #in~cond; {2123#false} is VALID [2018-11-14 17:29:30,404 INFO L273 TraceCheckUtils]: 34: Hoare triple {2123#false} assume ~cond == 0; {2123#false} is VALID [2018-11-14 17:29:30,404 INFO L273 TraceCheckUtils]: 35: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2018-11-14 17:29:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:30,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:29:30,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-14 17:29:30,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-14 17:29:30,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:30,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:29:30,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:30,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:29:30,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:29:30,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:29:30,503 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 10 states. [2018-11-14 17:29:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:32,082 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2018-11-14 17:29:32,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:29:32,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-14 17:29:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:29:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2018-11-14 17:29:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:29:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2018-11-14 17:29:32,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2018-11-14 17:29:32,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:32,256 INFO L225 Difference]: With dead ends: 258 [2018-11-14 17:29:32,256 INFO L226 Difference]: Without dead ends: 222 [2018-11-14 17:29:32,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:29:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-14 17:29:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 117. [2018-11-14 17:29:32,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:32,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand 117 states. [2018-11-14 17:29:32,449 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand 117 states. [2018-11-14 17:29:32,449 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 117 states. [2018-11-14 17:29:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:32,458 INFO L93 Difference]: Finished difference Result 222 states and 270 transitions. [2018-11-14 17:29:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 270 transitions. [2018-11-14 17:29:32,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:32,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:32,459 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 222 states. [2018-11-14 17:29:32,459 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 222 states. [2018-11-14 17:29:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:32,468 INFO L93 Difference]: Finished difference Result 222 states and 270 transitions. [2018-11-14 17:29:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 270 transitions. [2018-11-14 17:29:32,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:32,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:32,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:32,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-14 17:29:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2018-11-14 17:29:32,473 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 140 transitions. Word has length 36 [2018-11-14 17:29:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:32,474 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 140 transitions. [2018-11-14 17:29:32,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:29:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 140 transitions. [2018-11-14 17:29:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 17:29:32,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:32,475 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1] [2018-11-14 17:29:32,476 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:32,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1289391505, now seen corresponding path program 1 times [2018-11-14 17:29:32,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:32,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:32,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:32,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {3183#true} call ULTIMATE.init(); {3183#true} is VALID [2018-11-14 17:29:32,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {3183#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {3183#true} is VALID [2018-11-14 17:29:32,695 INFO L273 TraceCheckUtils]: 2: Hoare triple {3183#true} assume true; {3183#true} is VALID [2018-11-14 17:29:32,695 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3183#true} {3183#true} #116#return; {3183#true} is VALID [2018-11-14 17:29:32,695 INFO L256 TraceCheckUtils]: 4: Hoare triple {3183#true} call #t~ret19 := main(); {3183#true} is VALID [2018-11-14 17:29:32,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {3183#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {3183#true} is VALID [2018-11-14 17:29:32,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {3183#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {3183#true} is VALID [2018-11-14 17:29:32,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {3183#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3185#(= main_~i~0 0)} is VALID [2018-11-14 17:29:32,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {3185#(= main_~i~0 0)} assume true; {3185#(= main_~i~0 0)} is VALID [2018-11-14 17:29:32,697 INFO L273 TraceCheckUtils]: 9: Hoare triple {3185#(= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {3185#(= main_~i~0 0)} is VALID [2018-11-14 17:29:32,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {3185#(= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3185#(= main_~i~0 0)} is VALID [2018-11-14 17:29:32,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {3185#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3186#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:32,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {3186#(<= main_~i~0 1)} assume true; {3186#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:32,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {3186#(<= main_~i~0 1)} assume !(~i~0 < ~nodecount~0); {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {3187#(<= main_~nodecount~0 1)} ~i~0 := 0; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {3187#(<= main_~nodecount~0 1)} assume true; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {3187#(<= main_~nodecount~0 1)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {3187#(<= main_~nodecount~0 1)} assume true; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {3187#(<= main_~nodecount~0 1)} assume !(~j~0 < ~edgecount~0); {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {3187#(<= main_~nodecount~0 1)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {3187#(<= main_~nodecount~0 1)} assume true; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {3187#(<= main_~nodecount~0 1)} assume !(~i~0 < ~nodecount~0); {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {3187#(<= main_~nodecount~0 1)} ~i~0 := 0; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {3187#(<= main_~nodecount~0 1)} assume true; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,708 INFO L273 TraceCheckUtils]: 24: Hoare triple {3187#(<= main_~nodecount~0 1)} assume !(~i~0 < ~edgecount~0); {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:32,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {3187#(<= main_~nodecount~0 1)} ~i~0 := 0; {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} is VALID [2018-11-14 17:29:32,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} assume true; {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} is VALID [2018-11-14 17:29:32,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} is VALID [2018-11-14 17:29:32,710 INFO L256 TraceCheckUtils]: 28: Hoare triple {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {3183#true} is VALID [2018-11-14 17:29:32,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {3183#true} ~cond := #in~cond; {3183#true} is VALID [2018-11-14 17:29:32,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {3183#true} assume !(~cond == 0); {3183#true} is VALID [2018-11-14 17:29:32,710 INFO L273 TraceCheckUtils]: 31: Hoare triple {3183#true} assume true; {3183#true} is VALID [2018-11-14 17:29:32,711 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3183#true} {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} #120#return; {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} is VALID [2018-11-14 17:29:32,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} havoc #t~mem18; {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} is VALID [2018-11-14 17:29:32,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {3188#(and (<= main_~nodecount~0 1) (= main_~i~0 0))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3189#(<= main_~nodecount~0 main_~i~0)} is VALID [2018-11-14 17:29:32,713 INFO L273 TraceCheckUtils]: 35: Hoare triple {3189#(<= main_~nodecount~0 main_~i~0)} assume true; {3189#(<= main_~nodecount~0 main_~i~0)} is VALID [2018-11-14 17:29:32,713 INFO L273 TraceCheckUtils]: 36: Hoare triple {3189#(<= main_~nodecount~0 main_~i~0)} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3184#false} is VALID [2018-11-14 17:29:32,714 INFO L256 TraceCheckUtils]: 37: Hoare triple {3184#false} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {3184#false} is VALID [2018-11-14 17:29:32,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {3184#false} ~cond := #in~cond; {3184#false} is VALID [2018-11-14 17:29:32,714 INFO L273 TraceCheckUtils]: 39: Hoare triple {3184#false} assume ~cond == 0; {3184#false} is VALID [2018-11-14 17:29:32,714 INFO L273 TraceCheckUtils]: 40: Hoare triple {3184#false} assume !false; {3184#false} is VALID [2018-11-14 17:29:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:29:32,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:32,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:29:32,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:32,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:33,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {3183#true} call ULTIMATE.init(); {3183#true} is VALID [2018-11-14 17:29:33,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {3183#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {3183#true} is VALID [2018-11-14 17:29:33,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {3183#true} assume true; {3183#true} is VALID [2018-11-14 17:29:33,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3183#true} {3183#true} #116#return; {3183#true} is VALID [2018-11-14 17:29:33,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {3183#true} call #t~ret19 := main(); {3183#true} is VALID [2018-11-14 17:29:33,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {3183#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {3183#true} is VALID [2018-11-14 17:29:33,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {3183#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {3183#true} is VALID [2018-11-14 17:29:33,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {3183#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3214#(<= main_~i~0 0)} is VALID [2018-11-14 17:29:33,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {3214#(<= main_~i~0 0)} assume true; {3214#(<= main_~i~0 0)} is VALID [2018-11-14 17:29:33,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {3214#(<= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {3214#(<= main_~i~0 0)} is VALID [2018-11-14 17:29:33,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {3214#(<= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3214#(<= main_~i~0 0)} is VALID [2018-11-14 17:29:33,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {3214#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3186#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:33,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {3186#(<= main_~i~0 1)} assume true; {3186#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:33,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {3186#(<= main_~i~0 1)} assume !(~i~0 < ~nodecount~0); {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,177 INFO L273 TraceCheckUtils]: 14: Hoare triple {3187#(<= main_~nodecount~0 1)} ~i~0 := 0; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {3187#(<= main_~nodecount~0 1)} assume true; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {3187#(<= main_~nodecount~0 1)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {3187#(<= main_~nodecount~0 1)} assume true; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {3187#(<= main_~nodecount~0 1)} assume !(~j~0 < ~edgecount~0); {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {3187#(<= main_~nodecount~0 1)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,184 INFO L273 TraceCheckUtils]: 20: Hoare triple {3187#(<= main_~nodecount~0 1)} assume true; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {3187#(<= main_~nodecount~0 1)} assume !(~i~0 < ~nodecount~0); {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,185 INFO L273 TraceCheckUtils]: 22: Hoare triple {3187#(<= main_~nodecount~0 1)} ~i~0 := 0; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {3187#(<= main_~nodecount~0 1)} assume true; {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,187 INFO L273 TraceCheckUtils]: 24: Hoare triple {3187#(<= main_~nodecount~0 1)} assume !(~i~0 < ~edgecount~0); {3187#(<= main_~nodecount~0 1)} is VALID [2018-11-14 17:29:33,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {3187#(<= main_~nodecount~0 1)} ~i~0 := 0; {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2018-11-14 17:29:33,195 INFO L273 TraceCheckUtils]: 26: Hoare triple {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} assume true; {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2018-11-14 17:29:33,195 INFO L273 TraceCheckUtils]: 27: Hoare triple {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2018-11-14 17:29:33,196 INFO L256 TraceCheckUtils]: 28: Hoare triple {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {3183#true} is VALID [2018-11-14 17:29:33,196 INFO L273 TraceCheckUtils]: 29: Hoare triple {3183#true} ~cond := #in~cond; {3183#true} is VALID [2018-11-14 17:29:33,196 INFO L273 TraceCheckUtils]: 30: Hoare triple {3183#true} assume !(~cond == 0); {3183#true} is VALID [2018-11-14 17:29:33,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {3183#true} assume true; {3183#true} is VALID [2018-11-14 17:29:33,197 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3183#true} {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} #120#return; {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2018-11-14 17:29:33,197 INFO L273 TraceCheckUtils]: 33: Hoare triple {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} havoc #t~mem18; {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2018-11-14 17:29:33,198 INFO L273 TraceCheckUtils]: 34: Hoare triple {3269#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3297#(and (<= 1 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2018-11-14 17:29:33,198 INFO L273 TraceCheckUtils]: 35: Hoare triple {3297#(and (<= 1 main_~i~0) (<= main_~nodecount~0 1))} assume true; {3297#(and (<= 1 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2018-11-14 17:29:33,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {3297#(and (<= 1 main_~i~0) (<= main_~nodecount~0 1))} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {3184#false} is VALID [2018-11-14 17:29:33,201 INFO L256 TraceCheckUtils]: 37: Hoare triple {3184#false} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {3184#false} is VALID [2018-11-14 17:29:33,201 INFO L273 TraceCheckUtils]: 38: Hoare triple {3184#false} ~cond := #in~cond; {3184#false} is VALID [2018-11-14 17:29:33,201 INFO L273 TraceCheckUtils]: 39: Hoare triple {3184#false} assume ~cond == 0; {3184#false} is VALID [2018-11-14 17:29:33,201 INFO L273 TraceCheckUtils]: 40: Hoare triple {3184#false} assume !false; {3184#false} is VALID [2018-11-14 17:29:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:29:33,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:29:33,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-14 17:29:33,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-14 17:29:33,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:33,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:29:33,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:33,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:29:33,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:29:33,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:29:33,310 INFO L87 Difference]: Start difference. First operand 117 states and 140 transitions. Second operand 10 states. [2018-11-14 17:29:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:34,490 INFO L93 Difference]: Finished difference Result 293 states and 354 transitions. [2018-11-14 17:29:34,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:29:34,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-14 17:29:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:29:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2018-11-14 17:29:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:29:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2018-11-14 17:29:34,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 163 transitions. [2018-11-14 17:29:34,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:34,796 INFO L225 Difference]: With dead ends: 293 [2018-11-14 17:29:34,796 INFO L226 Difference]: Without dead ends: 203 [2018-11-14 17:29:34,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:29:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-14 17:29:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 141. [2018-11-14 17:29:35,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:35,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand 141 states. [2018-11-14 17:29:35,456 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 141 states. [2018-11-14 17:29:35,456 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 141 states. [2018-11-14 17:29:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:35,465 INFO L93 Difference]: Finished difference Result 203 states and 244 transitions. [2018-11-14 17:29:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 244 transitions. [2018-11-14 17:29:35,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:35,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:35,467 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 203 states. [2018-11-14 17:29:35,467 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 203 states. [2018-11-14 17:29:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:35,474 INFO L93 Difference]: Finished difference Result 203 states and 244 transitions. [2018-11-14 17:29:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 244 transitions. [2018-11-14 17:29:35,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:35,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:35,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:35,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-14 17:29:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 168 transitions. [2018-11-14 17:29:35,479 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 168 transitions. Word has length 41 [2018-11-14 17:29:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:35,479 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 168 transitions. [2018-11-14 17:29:35,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:29:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 168 transitions. [2018-11-14 17:29:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:29:35,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:35,480 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2018-11-14 17:29:35,480 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:35,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:35,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1270815215, now seen corresponding path program 1 times [2018-11-14 17:29:35,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:35,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:35,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:36,647 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 28 [2018-11-14 17:29:37,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {4294#true} call ULTIMATE.init(); {4294#true} is VALID [2018-11-14 17:29:37,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {4294#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {4294#true} is VALID [2018-11-14 17:29:37,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {4294#true} assume true; {4294#true} is VALID [2018-11-14 17:29:37,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4294#true} {4294#true} #116#return; {4294#true} is VALID [2018-11-14 17:29:37,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {4294#true} call #t~ret19 := main(); {4294#true} is VALID [2018-11-14 17:29:37,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {4294#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nodecount~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~edgecount~0 := #t~nondet2;havoc #t~nondet2; {4294#true} is VALID [2018-11-14 17:29:37,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {4294#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {4294#true} is VALID [2018-11-14 17:29:37,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {4294#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 0, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 4, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 8, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 12, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 16, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 20, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 24, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 28, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 32, 4);call write~unchecked~int(4, ~#Source~0.base, ~#Source~0.offset + 36, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 40, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 44, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 48, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 52, 4);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset + 56, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 60, 4);call write~unchecked~int(1, ~#Source~0.base, ~#Source~0.offset + 64, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 68, 4);call write~unchecked~int(2, ~#Source~0.base, ~#Source~0.offset + 72, 4);call write~unchecked~int(3, ~#Source~0.base, ~#Source~0.offset + 76, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 0, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 4, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 8, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 12, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 16, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 20, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 24, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 28, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 32, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 36, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 40, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 44, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 48, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 52, 4);call write~unchecked~int(3, ~#Dest~0.base, ~#Dest~0.offset + 56, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 60, 4);call write~unchecked~int(2, ~#Dest~0.base, ~#Dest~0.offset + 64, 4);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset + 68, 4);call write~unchecked~int(0, ~#Dest~0.base, ~#Dest~0.offset + 72, 4);call write~unchecked~int(4, ~#Dest~0.base, ~#Dest~0.offset + 76, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset + 0, 4);call write~unchecked~int(1, ~#Weight~0.base, ~#Weight~0.offset + 4, 4);call write~unchecked~int(2, ~#Weight~0.base, ~#Weight~0.offset + 8, 4);call write~unchecked~int(3, ~#Weight~0.base, ~#Weight~0.offset + 12, 4);call write~unchecked~int(4, ~#Weight~0.base, ~#Weight~0.offset + 16, 4);call write~unchecked~int(5, ~#Weight~0.base, ~#Weight~0.offset + 20, 4);call write~unchecked~int(6, ~#Weight~0.base, ~#Weight~0.offset + 24, 4);call write~unchecked~int(7, ~#Weight~0.base, ~#Weight~0.offset + 28, 4);call write~unchecked~int(8, ~#Weight~0.base, ~#Weight~0.offset + 32, 4);call write~unchecked~int(9, ~#Weight~0.base, ~#Weight~0.offset + 36, 4);call write~unchecked~int(10, ~#Weight~0.base, ~#Weight~0.offset + 40, 4);call write~unchecked~int(11, ~#Weight~0.base, ~#Weight~0.offset + 44, 4);call write~unchecked~int(12, ~#Weight~0.base, ~#Weight~0.offset + 48, 4);call write~unchecked~int(13, ~#Weight~0.base, ~#Weight~0.offset + 52, 4);call write~unchecked~int(14, ~#Weight~0.base, ~#Weight~0.offset + 56, 4);call write~unchecked~int(15, ~#Weight~0.base, ~#Weight~0.offset + 60, 4);call write~unchecked~int(16, ~#Weight~0.base, ~#Weight~0.offset + 64, 4);call write~unchecked~int(17, ~#Weight~0.base, ~#Weight~0.offset + 68, 4);call write~unchecked~int(18, ~#Weight~0.base, ~#Weight~0.offset + 72, 4);call write~unchecked~int(19, ~#Weight~0.base, ~#Weight~0.offset + 76, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4296#(and (= 1 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 |main_~#Dest~0.offset|) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:37,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {4296#(and (= 1 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 |main_~#Dest~0.offset|) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume true; {4296#(and (= 1 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 |main_~#Dest~0.offset|) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:37,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {4296#(and (= 1 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 |main_~#Dest~0.offset|) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {4296#(and (= 1 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 |main_~#Dest~0.offset|) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:37,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {4296#(and (= 1 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 |main_~#Dest~0.offset|) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4297#(and (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:29:37,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {4297#(and (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4298#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {4298#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} assume true; {4298#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {4298#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {4298#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,177 INFO L273 TraceCheckUtils]: 14: Hoare triple {4298#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} ~i~0 := 0; {4298#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {4298#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} assume true; {4298#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {4298#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4299#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= 0 |main_~#Dest~0.offset|) (= (+ (* 4 main_~j~0) |main_~#Dest~0.offset|) 0) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,184 INFO L273 TraceCheckUtils]: 17: Hoare triple {4299#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= 0 |main_~#Dest~0.offset|) (= (+ (* 4 main_~j~0) |main_~#Dest~0.offset|) 0) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (= |main_~#distance~0.offset| 0))} assume true; {4299#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= 0 |main_~#Dest~0.offset|) (= (+ (* 4 main_~j~0) |main_~#Dest~0.offset|) 0) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {4299#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= 0 |main_~#Dest~0.offset|) (= (+ (* 4 main_~j~0) |main_~#Dest~0.offset|) 0) (= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (not (= |main_~#Dest~0.base| |main_~#Weight~0.base|)) (= |main_~#distance~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem6 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~j~0 * 4, 4);~x~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#Source~0.base, ~#Source~0.offset + ~j~0 * 4, 4);~y~0 := #t~mem7;havoc #t~mem7;call #t~mem10 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem8 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem9 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~j~0 * 4, 4); {4300#(and (= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 main_~x~0)) (- 1)) 0)) (<= 0 |main_~#Dest~0.offset|) (= (+ (* 4 main_~j~0) |main_~#Dest~0.offset|) 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* 4 main_~j~0) |main_~#Dest~0.offset|))) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {4300#(and (= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 main_~x~0)) (- 1)) 0)) (<= 0 |main_~#Dest~0.offset|) (= (+ (* 4 main_~j~0) |main_~#Dest~0.offset|) 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* 4 main_~j~0) |main_~#Dest~0.offset|))) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0))} assume #t~mem10 > #t~mem8 + #t~mem9;havoc #t~mem8;havoc #t~mem9;havoc #t~mem10;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4); {4301#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= (+ (* 4 main_~j~0) |main_~#Dest~0.offset|) 0) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2018-11-14 17:29:37,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {4301#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (= (+ (* 4 main_~j~0) |main_~#Dest~0.offset|) 0) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} #t~post5 := ~j~0;~j~0 := #t~post5 + 1;havoc #t~post5; {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2018-11-14 17:29:37,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume true; {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2018-11-14 17:29:37,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume !(~j~0 < ~edgecount~0); {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2018-11-14 17:29:37,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2018-11-14 17:29:37,196 INFO L273 TraceCheckUtils]: 24: Hoare triple {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume true; {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2018-11-14 17:29:37,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume !(~i~0 < ~nodecount~0); {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2018-11-14 17:29:37,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {4302#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (<= 0 |main_~#Dest~0.offset|) (<= |main_~#Dest~0.offset| 0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} ~i~0 := 0; {4303#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= 0 (+ (* 4 main_~i~0) |main_~#Dest~0.offset|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~i~0 0))} is VALID [2018-11-14 17:29:37,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {4303#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= 0 (+ (* 4 main_~i~0) |main_~#Dest~0.offset|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~i~0 0))} assume true; {4303#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= 0 (+ (* 4 main_~i~0) |main_~#Dest~0.offset|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~i~0 0))} is VALID [2018-11-14 17:29:37,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {4303#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= 0 (+ (* 4 main_~i~0) |main_~#Dest~0.offset|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem12 := read~int(~#Dest~0.base, ~#Dest~0.offset + ~i~0 * 4, 4);~x~0 := #t~mem12;havoc #t~mem12;call #t~mem13 := read~int(~#Source~0.base, ~#Source~0.offset + ~i~0 * 4, 4);~y~0 := #t~mem13;havoc #t~mem13;call #t~mem16 := read~int(~#distance~0.base, ~#distance~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#distance~0.base, ~#distance~0.offset + ~y~0 * 4, 4);call #t~mem15 := read~int(~#Weight~0.base, ~#Weight~0.offset + ~i~0 * 4, 4); {4304#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:37,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {4304#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem16 > #t~mem14 + #t~mem15);havoc #t~mem14;havoc #t~mem16;havoc #t~mem15; {4304#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:37,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {4304#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {4305#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {4305#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume true; {4305#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,204 INFO L273 TraceCheckUtils]: 32: Hoare triple {4305#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} assume !(~i~0 < ~edgecount~0); {4305#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} is VALID [2018-11-14 17:29:37,205 INFO L273 TraceCheckUtils]: 33: Hoare triple {4305#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0))} ~i~0 := 0; {4304#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:37,205 INFO L273 TraceCheckUtils]: 34: Hoare triple {4304#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume true; {4304#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:29:37,206 INFO L273 TraceCheckUtils]: 35: Hoare triple {4304#(and (= 0 (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem18 := read~int(~#distance~0.base, ~#distance~0.offset + ~i~0 * 4, 4); {4306#(= |main_#t~mem18| 0)} is VALID [2018-11-14 17:29:37,206 INFO L256 TraceCheckUtils]: 36: Hoare triple {4306#(= |main_#t~mem18| 0)} call __VERIFIER_assert((if #t~mem18 >= 0 then 1 else 0)); {4307#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:29:37,207 INFO L273 TraceCheckUtils]: 37: Hoare triple {4307#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4308#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:29:37,207 INFO L273 TraceCheckUtils]: 38: Hoare triple {4308#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {4295#false} is VALID [2018-11-14 17:29:37,208 INFO L273 TraceCheckUtils]: 39: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2018-11-14 17:29:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:37,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:37,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:29:37,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:37,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:47,643 WARN L179 SmtUtils]: Spent 10.17 s on a formula simplification that was a NOOP. DAG size: 211 [2018-11-14 17:29:47,936 INFO L303 Elim1Store]: Index analysis took 291 ms [2018-11-14 17:29:47,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-14 17:29:48,480 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:49,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:49,257 INFO L303 Elim1Store]: Index analysis took 1301 ms [2018-11-14 17:29:49,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-11-14 17:29:49,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:50,676 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:50,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:51,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:29:51,121 INFO L303 Elim1Store]: Index analysis took 1803 ms [2018-11-14 17:29:51,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-14 17:29:51,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:29:54,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:29:57,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:30:12,967 INFO L303 Elim1Store]: Index analysis took 550 ms [2018-11-14 17:30:12,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 680 treesize of output 573 [2018-11-14 17:30:36,300 WARN L179 SmtUtils]: Spent 23.32 s on a formula simplification that was a NOOP. DAG size: 176 [2018-11-14 17:30:36,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 374 [2018-11-14 17:30:36,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:36,988 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:36,989 INFO L303 Elim1Store]: Index analysis took 632 ms [2018-11-14 17:30:36,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 379 [2018-11-14 17:30:37,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:37,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:37,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:37,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:37,502 INFO L303 Elim1Store]: Index analysis took 462 ms [2018-11-14 17:30:37,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 404 [2018-11-14 17:30:37,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:37,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:37,867 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:37,868 INFO L303 Elim1Store]: Index analysis took 292 ms [2018-11-14 17:30:37,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 423 [2018-11-14 17:30:38,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:39,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:39,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:39,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:39,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:39,611 INFO L303 Elim1Store]: Index analysis took 1655 ms [2018-11-14 17:30:39,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 450 [2018-11-14 17:30:40,021 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:40,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:40,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:40,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:40,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:41,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:41,156 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:41,157 INFO L303 Elim1Store]: Index analysis took 1515 ms [2018-11-14 17:30:41,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 485 [2018-11-14 17:30:41,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:41,861 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:41,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:42,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:42,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:42,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:42,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:42,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:42,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:42,706 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:42,707 INFO L303 Elim1Store]: Index analysis took 1531 ms [2018-11-14 17:30:42,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 24 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 528 [2018-11-14 17:30:43,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:43,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:43,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:43,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:44,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:44,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:44,693 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:44,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:44,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:44,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:45,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:45,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:45,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:45,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:45,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:45,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:45,804 INFO L303 Elim1Store]: Index analysis took 3028 ms [2018-11-14 17:30:45,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 34 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 603 [2018-11-14 17:30:46,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:46,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:46,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:46,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:46,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:46,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:46,870 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:46,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:46,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:47,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:47,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:47,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:47,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:48,069 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:48,070 INFO L303 Elim1Store]: Index analysis took 2210 ms [2018-11-14 17:30:48,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 42 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 393 treesize of output 662 [2018-11-14 17:30:48,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:48,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:48,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:48,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:48,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:48,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:48,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:48,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:49,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:49,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:49,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:49,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:49,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:49,312 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:49,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:49,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:49,604 INFO L303 Elim1Store]: Index analysis took 1496 ms [2018-11-14 17:30:49,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 51 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 729 [2018-11-14 17:30:50,302 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:50,585 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:50,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:50,706 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:50,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:50,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:50,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:50,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:51,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:51,300 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:51,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:51,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:51,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:51,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:51,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:51,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:52,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:52,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:52,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:52,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:52,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:52,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:52,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:52,590 INFO L303 Elim1Store]: Index analysis took 2899 ms [2018-11-14 17:30:52,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 65 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 836 [2018-11-14 17:30:52,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:52,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:53,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:53,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:53,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:53,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:53,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:53,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:54,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:54,430 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:54,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:55,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:55,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:55,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:55,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:55,811 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:55,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:55,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:55,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:55,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:55,998 INFO L303 Elim1Store]: Index analysis took 3367 ms [2018-11-14 17:30:56,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 76 disjoint index pairs (out of 55 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 416 treesize of output 919 [2018-11-14 17:30:56,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:56,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:56,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:56,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:56,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:56,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:56,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:57,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:57,632 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:57,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:57,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:57,802 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:57,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:57,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:58,046 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:58,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:58,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:58,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:58,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:58,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:58,677 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:59,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:59,327 INFO L303 Elim1Store]: Index analysis took 3260 ms [2018-11-14 17:30:59,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 88 disjoint index pairs (out of 66 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 413 treesize of output 1010 [2018-11-14 17:30:59,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:59,740 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:59,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:59,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:30:59,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:00,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:00,031 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:00,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:00,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:00,312 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:00,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:00,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:00,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:00,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:00,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:01,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:01,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:01,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:01,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:01,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:01,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:01,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:02,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:02,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:02,588 INFO L303 Elim1Store]: Index analysis took 3228 ms [2018-11-14 17:31:02,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 101 disjoint index pairs (out of 78 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 410 treesize of output 1109 [2018-11-14 17:31:02,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:02,809 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:03,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:03,488 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:03,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:03,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:03,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:03,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:03,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:03,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:03,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:04,033 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:04,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:31:04,181 INFO L700 Elim1Store]: detected not equals via solver