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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:08:43,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:08:43,328 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:08:43,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:08:43,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:08:43,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:08:43,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:08:43,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:08:43,348 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:08:43,349 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:08:43,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:08:43,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:08:43,352 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:08:43,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:08:43,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:08:43,361 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:08:43,362 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:08:43,366 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:08:43,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:08:43,373 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:08:43,375 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:08:43,376 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:08:43,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:08:43,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:08:43,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:08:43,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:08:43,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:08:43,386 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:08:43,387 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:08:43,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:08:43,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:08:43,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:08:43,391 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:08:43,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:08:43,393 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:08:43,394 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:08:43,394 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-23 13:08:43,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:08:43,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:08:43,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:08:43,422 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:08:43,423 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:08:43,423 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:08:43,423 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:08:43,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:08:43,426 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:08:43,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:08:43,426 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:08:43,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:08:43,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:08:43,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:08:43,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:08:43,427 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:08:43,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:08:43,427 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:08:43,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:08:43,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:08:43,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:08:43,429 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:08:43,429 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:08:43,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:43,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:08:43,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:08:43,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:08:43,431 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:08:43,431 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:08:43,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:08:43,431 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:08:43,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:08:43,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:08:43,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:08:43,495 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:08:43,495 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:08:43,496 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-23 13:08:43,556 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fef35f0e/02492626867e432480772dd9648a88b6/FLAG4bfe9ecb2 [2018-11-23 13:08:44,015 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:08:44,016 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-23 13:08:44,022 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fef35f0e/02492626867e432480772dd9648a88b6/FLAG4bfe9ecb2 [2018-11-23 13:08:44,393 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fef35f0e/02492626867e432480772dd9648a88b6 [2018-11-23 13:08:44,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:08:44,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:08:44,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:44,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:08:44,408 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:08:44,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab305fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44, skipping insertion in model container [2018-11-23 13:08:44,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:08:44,448 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:08:44,693 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:44,699 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:08:44,741 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:44,780 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:08:44,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44 WrapperNode [2018-11-23 13:08:44,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:44,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:44,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:08:44,782 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:08:44,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:44,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:08:44,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:08:44,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:08:44,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:08:44,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:08:44,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:08:44,878 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:08:44,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (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-23 13:08:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:08:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:08:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:08:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:08:45,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:08:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:08:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:08:45,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:08:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:08:45,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:08:45,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:08:45,641 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:08:45,642 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:08:45,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:45 BoogieIcfgContainer [2018-11-23 13:08:45,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:08:45,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:08:45,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:08:45,647 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:08:45,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:08:44" (1/3) ... [2018-11-23 13:08:45,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa38541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:45, skipping insertion in model container [2018-11-23 13:08:45,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (2/3) ... [2018-11-23 13:08:45,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa38541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:45, skipping insertion in model container [2018-11-23 13:08:45,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:45" (3/3) ... [2018-11-23 13:08:45,651 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-23 13:08:45,660 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:08:45,667 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:08:45,685 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:08:45,718 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:08:45,719 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:08:45,719 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:08:45,720 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:08:45,720 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:08:45,720 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:08:45,720 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:08:45,721 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:08:45,721 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:08:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 13:08:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:08:45,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:45,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:45,752 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:45,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:45,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1079158542, now seen corresponding path program 1 times [2018-11-23 13:08:45,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:45,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:45,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:45,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:45,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:46,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 13:08:46,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 13:08:46,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 13:08:46,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #54#return; {27#true} is VALID [2018-11-23 13:08:46,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret11 := main(); {27#true} is VALID [2018-11-23 13:08:46,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0;~index1~0 := #t~nondet1;havoc #t~nondet1;assume 0 != (if ~index1~0 % 4294967296 < 100000 then 1 else 0);~index2~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~index2~0 % 4294967296 < 100000 then 1 else 0); {29#(and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)))} is VALID [2018-11-23 13:08:46,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#(and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)))} assume !!(~index1~0 % 4294967296 < ~index2~0 % 4294967296); {29#(and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)))} is VALID [2018-11-23 13:08:46,414 INFO L256 TraceCheckUtils]: 7: Hoare triple {29#(and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)))} call __VERIFIER_assert((if ~index1~0 % 4294967296 < 100000 && ~index2~0 % 4294967296 < 100000 then 1 else 0)); {30#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 13:08:46,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {31#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 13:08:46,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {28#false} is VALID [2018-11-23 13:08:46,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 13:08:46,420 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-23 13:08:46,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:46,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:08:46,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:08:46,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:46,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:08:46,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:46,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:08:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:08:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:08:46,500 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-23 13:08:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,213 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2018-11-23 13:08:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:08:47,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:08:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 13:08:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 13:08:47,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2018-11-23 13:08:47,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:47,593 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:08:47,594 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:08:47,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:08:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:08:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-11-23 13:08:47,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:47,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 25 states. [2018-11-23 13:08:47,749 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 25 states. [2018-11-23 13:08:47,749 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 25 states. [2018-11-23 13:08:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,755 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 13:08:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 13:08:47,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:47,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:47,756 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 30 states. [2018-11-23 13:08:47,757 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 30 states. [2018-11-23 13:08:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,761 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 13:08:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 13:08:47,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:47,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:47,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:47,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:08:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 13:08:47,772 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2018-11-23 13:08:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:47,773 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 13:08:47,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:08:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 13:08:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:08:47,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:47,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:47,775 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:47,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:47,777 INFO L82 PathProgramCache]: Analyzing trace with hash -476045897, now seen corresponding path program 1 times [2018-11-23 13:08:47,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:47,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:47,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:47,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:47,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:47,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2018-11-23 13:08:47,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {208#true} is VALID [2018-11-23 13:08:47,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2018-11-23 13:08:47,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #54#return; {208#true} is VALID [2018-11-23 13:08:47,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret11 := main(); {208#true} is VALID [2018-11-23 13:08:47,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {208#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0;~index1~0 := #t~nondet1;havoc #t~nondet1;assume 0 != (if ~index1~0 % 4294967296 < 100000 then 1 else 0);~index2~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~index2~0 % 4294967296 < 100000 then 1 else 0); {210#(= main_~loop_entered~0 0)} is VALID [2018-11-23 13:08:47,902 INFO L273 TraceCheckUtils]: 6: Hoare triple {210#(= main_~loop_entered~0 0)} assume !(~index1~0 % 4294967296 < ~index2~0 % 4294967296); {210#(= main_~loop_entered~0 0)} is VALID [2018-11-23 13:08:47,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {210#(= main_~loop_entered~0 0)} assume 0 != ~loop_entered~0 % 4294967296; {209#false} is VALID [2018-11-23 13:08:47,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {209#false} assume !!(~index2~0 % 4294967296 < ~index1~0 % 4294967296);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~index1~0 % 4294967296 % 4294967296 else ~index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~index2~0 % 4294967296 % 4294967296 else ~index2~0 % 4294967296 % 4294967296 - 4294967296), 4); {209#false} is VALID [2018-11-23 13:08:47,906 INFO L256 TraceCheckUtils]: 9: Hoare triple {209#false} call __VERIFIER_assert((if #t~mem7 % 4294967296 == #t~mem8 % 4294967296 then 1 else 0)); {209#false} is VALID [2018-11-23 13:08:47,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2018-11-23 13:08:47,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {209#false} assume 0 == ~cond; {209#false} is VALID [2018-11-23 13:08:47,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {209#false} assume !false; {209#false} is VALID [2018-11-23 13:08:47,908 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-23 13:08:47,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:47,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:08:47,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:08:47,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:47,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:08:47,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:47,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:08:47,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:08:47,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:08:47,930 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-23 13:08:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:48,021 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 13:08:48,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:08:48,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:08:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 13:08:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 13:08:48,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 13:08:48,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:48,113 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:08:48,113 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:08:48,115 INFO L631 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-23 13:08:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:08:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 13:08:48,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:48,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 13:08:48,139 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 13:08:48,140 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 13:08:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:48,142 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 13:08:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:08:48,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:48,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:48,143 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 13:08:48,143 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 13:08:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:48,148 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 13:08:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:08:48,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:48,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:48,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:48,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:08:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 13:08:48,152 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-11-23 13:08:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:48,153 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 13:08:48,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:08:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:08:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:08:48,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:48,154 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:48,154 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:48,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:48,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1393486425, now seen corresponding path program 1 times [2018-11-23 13:08:48,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:48,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:48,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:48,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:48,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:48,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2018-11-23 13:08:48,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {353#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {353#true} is VALID [2018-11-23 13:08:48,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-23 13:08:48,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #54#return; {353#true} is VALID [2018-11-23 13:08:48,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret11 := main(); {353#true} is VALID [2018-11-23 13:08:48,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {353#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0;~index1~0 := #t~nondet1;havoc #t~nondet1;assume 0 != (if ~index1~0 % 4294967296 < 100000 then 1 else 0);~index2~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~index2~0 % 4294967296 < 100000 then 1 else 0); {355#(<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999))} is VALID [2018-11-23 13:08:48,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {355#(<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999))} assume !!(~index1~0 % 4294967296 < ~index2~0 % 4294967296); {356#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (< (* 4294967296 (div main_~index2~0 4294967296)) main_~index2~0))} is VALID [2018-11-23 13:08:48,550 INFO L256 TraceCheckUtils]: 7: Hoare triple {356#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (< (* 4294967296 (div main_~index2~0 4294967296)) main_~index2~0))} call __VERIFIER_assert((if ~index1~0 % 4294967296 < 100000 && ~index2~0 % 4294967296 < 100000 then 1 else 0)); {353#true} is VALID [2018-11-23 13:08:48,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2018-11-23 13:08:48,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2018-11-23 13:08:48,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-23 13:08:48,556 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {353#true} {356#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (< (* 4294967296 (div main_~index2~0 4294967296)) main_~index2~0))} #58#return; {356#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (< (* 4294967296 (div main_~index2~0 4294967296)) main_~index2~0))} is VALID [2018-11-23 13:08:48,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {356#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (< (* 4294967296 (div main_~index2~0 4294967296)) main_~index2~0))} call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~index1~0 % 4294967296 % 4294967296 else ~index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~index2~0 % 4294967296 % 4294967296 else ~index2~0 % 4294967296 % 4294967296 - 4294967296), 4);assume 0 != (if #t~mem3 % 4294967296 == #t~mem4 % 4294967296 then 1 else 0);havoc #t~mem3;havoc #t~mem4;#t~post5 := ~index1~0;~index1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~index2~0;~index2~0 := #t~post6 - 1;havoc #t~post6;~loop_entered~0 := 1; {357#(<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99998))} is VALID [2018-11-23 13:08:48,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#(<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99998))} assume !!(~index1~0 % 4294967296 < ~index2~0 % 4294967296); {358#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99998)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} is VALID [2018-11-23 13:08:48,577 INFO L256 TraceCheckUtils]: 14: Hoare triple {358#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99998)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} call __VERIFIER_assert((if ~index1~0 % 4294967296 < 100000 && ~index2~0 % 4294967296 < 100000 then 1 else 0)); {359#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 13:08:48,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {359#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {360#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 13:08:48,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {360#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {354#false} is VALID [2018-11-23 13:08:48,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {354#false} assume !false; {354#false} is VALID [2018-11-23 13:08:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:48,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:48,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:08:48,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:08:48,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:48,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:08:48,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:48,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:08:48,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:08:48,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:08:48,619 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-11-23 13:08:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:49,216 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-23 13:08:49,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:08:49,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:08:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:08:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2018-11-23 13:08:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:08:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2018-11-23 13:08:49,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2018-11-23 13:08:49,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:49,323 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:08:49,324 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:08:49,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:08:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:08:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2018-11-23 13:08:49,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:49,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 24 states. [2018-11-23 13:08:49,350 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 24 states. [2018-11-23 13:08:49,350 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 24 states. [2018-11-23 13:08:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:49,355 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 13:08:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 13:08:49,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:49,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:49,357 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 36 states. [2018-11-23 13:08:49,357 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 36 states. [2018-11-23 13:08:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:49,361 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 13:08:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 13:08:49,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:49,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:49,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:49,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:08:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 13:08:49,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2018-11-23 13:08:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:49,366 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 13:08:49,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:08:49,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 13:08:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:08:49,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:49,367 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:49,367 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:49,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash 618852702, now seen corresponding path program 1 times [2018-11-23 13:08:49,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:49,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:49,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:49,968 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-23 13:08:50,423 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-11-23 13:08:50,865 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2018-11-23 13:08:51,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {527#true} is VALID [2018-11-23 13:08:51,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {527#true} is VALID [2018-11-23 13:08:51,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2018-11-23 13:08:51,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {527#true} {527#true} #54#return; {527#true} is VALID [2018-11-23 13:08:51,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {527#true} call #t~ret11 := main(); {527#true} is VALID [2018-11-23 13:08:51,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {527#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0;~index1~0 := #t~nondet1;havoc #t~nondet1;assume 0 != (if ~index1~0 % 4294967296 < 100000 then 1 else 0);~index2~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~index2~0 % 4294967296 < 100000 then 1 else 0); {529#(and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)))} is VALID [2018-11-23 13:08:51,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {529#(and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)))} assume !!(~index1~0 % 4294967296 < ~index2~0 % 4294967296); {530#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} is VALID [2018-11-23 13:08:51,584 INFO L256 TraceCheckUtils]: 7: Hoare triple {530#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} call __VERIFIER_assert((if ~index1~0 % 4294967296 < 100000 && ~index2~0 % 4294967296 < 100000 then 1 else 0)); {527#true} is VALID [2018-11-23 13:08:51,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2018-11-23 13:08:51,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2018-11-23 13:08:51,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {527#true} assume true; {527#true} is VALID [2018-11-23 13:08:51,589 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {527#true} {530#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} #58#return; {530#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} is VALID [2018-11-23 13:08:51,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {530#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~index1~0 % 4294967296 % 4294967296 else ~index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~index2~0 % 4294967296 % 4294967296 else ~index2~0 % 4294967296 % 4294967296 - 4294967296), 4);assume 0 != (if #t~mem3 % 4294967296 == #t~mem4 % 4294967296 then 1 else 0);havoc #t~mem3;havoc #t~mem4;#t~post5 := ~index1~0;~index1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~index2~0;~index2~0 := #t~post6 - 1;havoc #t~post6;~loop_entered~0 := 1; {531#(or (and (< (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647) main_~index1~0) (or (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))))) 4294967296))))) (and (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184)))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296)))) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647))))) (and (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))) (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 100000))) (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647)) (or (and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647)) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296))))) (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)))) 4294967296))))))))} is VALID [2018-11-23 13:08:51,616 INFO L273 TraceCheckUtils]: 13: Hoare triple {531#(or (and (< (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647) main_~index1~0) (or (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))))) 4294967296))))) (and (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184)))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296)))) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647))))) (and (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))) (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 100000))) (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647)) (or (and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647)) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296))))) (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)))) 4294967296))))))))} assume !(~index1~0 % 4294967296 < ~index2~0 % 4294967296); {531#(or (and (< (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647) main_~index1~0) (or (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))))) 4294967296))))) (and (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184)))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296)))) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647))))) (and (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))) (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 100000))) (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647)) (or (and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647)) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296))))) (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)))) 4294967296))))))))} is VALID [2018-11-23 13:08:51,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {531#(or (and (< (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647) main_~index1~0) (or (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))))) 4294967296))))) (and (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184)))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296)))) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647))))) (and (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))) (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 100000))) (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647)) (or (and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647)) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296))))) (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)))) 4294967296))))))))} assume 0 != ~loop_entered~0 % 4294967296; {531#(or (and (< (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647) main_~index1~0) (or (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))))) 4294967296))))) (and (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184)))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296)))) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647))))) (and (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))) (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 100000))) (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647)) (or (and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647)) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296))))) (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)))) 4294967296))))))))} is VALID [2018-11-23 13:08:51,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {531#(or (and (< (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647) main_~index1~0) (or (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))))) 4294967296))))) (and (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184))) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset| (- 17179869184)))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296)))) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647))))) (and (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))) (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 100000))) (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 2147483647)) (or (and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647)) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|)) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|))) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset|))) 4294967296))))) (and (< (+ (* 4294967296 (div main_~index2~0 4294967296)) 2147483647) main_~index2~0) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)) (* 4294967296 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* (- 17179869184) (div main_~index2~0 4294967296)) (* 4 main_~index2~0) |main_~#array~0.offset| (- 17179869184))) (* (- 1) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~index1~0) (* (- 17179869184) (div main_~index1~0 4294967296)) |main_~#array~0.offset|)))) 4294967296))))))))} assume !!(~index2~0 % 4294967296 < ~index1~0 % 4294967296);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~index1~0 % 4294967296 % 4294967296 else ~index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~index2~0 % 4294967296 % 4294967296 else ~index2~0 % 4294967296 % 4294967296 - 4294967296), 4); {532#(and (< (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|) (+ (* 4294967296 (div |main_#t~mem7| 4294967296)) |main_#t~mem8| 1)) (<= (+ (* 4294967296 (div |main_#t~mem7| 4294967296)) |main_#t~mem8|) (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|)))} is VALID [2018-11-23 13:08:51,639 INFO L256 TraceCheckUtils]: 16: Hoare triple {532#(and (< (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|) (+ (* 4294967296 (div |main_#t~mem7| 4294967296)) |main_#t~mem8| 1)) (<= (+ (* 4294967296 (div |main_#t~mem7| 4294967296)) |main_#t~mem8|) (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|)))} call __VERIFIER_assert((if #t~mem7 % 4294967296 == #t~mem8 % 4294967296 then 1 else 0)); {533#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 13:08:51,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {533#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {534#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 13:08:51,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {534#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {528#false} is VALID [2018-11-23 13:08:51,645 INFO L273 TraceCheckUtils]: 19: Hoare triple {528#false} assume !false; {528#false} is VALID [2018-11-23 13:08:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:51,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:51,651 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-23 13:08:51,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:51,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:52,540 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2018-11-23 13:08:53,547 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:08:53,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:08:56,175 INFO L478 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 58 treesize of output 50 [2018-11-23 13:08:56,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:08:56,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:08:58,314 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (+ (* 4 (mod (+ v_prenex_14 4294967295) 4294967296)) v_prenex_15) (+ (* 4 (mod v_prenex_13 4294967296)) v_prenex_15)) [2018-11-23 13:08:58,322 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:08:58,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:09:00,350 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (select v_arrayElimCell_1 (+ (* 4 (mod v_prenex_13 4294967296)) v_prenex_15)) (select v_arrayElimCell_1 (+ (* 4 (mod (+ v_prenex_13 1) 4294967296)) v_prenex_15))) [2018-11-23 13:09:00,392 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:09:00,398 INFO L303 Elim1Store]: Index analysis took 4216 ms [2018-11-23 13:09:00,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 79 [2018-11-23 13:09:00,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:09:00,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:09:03,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:09:03,028 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 20 variables, input treesize:433, output treesize:7 [2018-11-23 13:09:05,036 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:09:05,037 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_10, v_prenex_6, v_prenex_8, v_prenex_9, v_prenex_7, v_prenex_5, v_prenex_1, v_prenex_2, v_prenex_4, v_prenex_3, v_prenex_12, v_prenex_11, v_prenex_13, v_prenex_15, v_prenex_14, |#memory_int|, |main_~#array~0.base|, main_~index1~0, |main_~#array~0.offset|, main_~index2~0]. (or (let ((.cse3 (+ v_prenex_7 1))) (let ((.cse0 (* 4294967296 (div .cse3 4294967296))) (.cse1 (select v_prenex_10 v_prenex_6)) (.cse2 (mod v_prenex_8 4294967296)) (.cse4 (mod v_prenex_7 4294967296))) (and (<= (+ .cse0 v_prenex_8) (+ (* 4294967296 (div (+ v_prenex_8 (- 1)) 4294967296)) v_prenex_7 1)) (= (select .cse1 (+ (* 4 .cse2) v_prenex_9 (- 17179869184))) |main_#t~mem7|) (<= v_prenex_7 (+ .cse0 99998)) (= (mod (select .cse1 (+ (* 4 (mod .cse3 4294967296)) v_prenex_9)) 4294967296) (mod (select .cse1 (+ (* 4 (mod (+ v_prenex_8 4294967295) 4294967296)) v_prenex_9)) 4294967296)) (= (select .cse1 (+ (* 4 .cse4) v_prenex_9)) |main_#t~mem8|) (not (<= .cse2 2147483647)) (< .cse4 .cse2) (<= .cse4 2147483647)))) (let ((.cse7 (+ v_prenex_2 1))) (let ((.cse5 (mod v_prenex_2 4294967296)) (.cse8 (* 4294967296 (div .cse7 4294967296))) (.cse6 (select v_prenex_5 v_prenex_1)) (.cse9 (mod v_prenex_3 4294967296))) (and (not (<= .cse5 2147483647)) (= (select .cse6 (+ (* 4 .cse5) v_prenex_4 (- 17179869184))) |main_#t~mem8|) (= (mod (select .cse6 (+ (* 4 (mod .cse7 4294967296)) v_prenex_4)) 4294967296) (mod (select .cse6 (+ (* 4 (mod (+ v_prenex_3 4294967295) 4294967296)) v_prenex_4)) 4294967296)) (<= (+ .cse8 v_prenex_3) (+ (* 4294967296 (div (+ v_prenex_3 (- 1)) 4294967296)) v_prenex_2 1)) (< .cse5 .cse9) (<= v_prenex_2 (+ .cse8 99998)) (= (select .cse6 (+ (* 4 .cse9) v_prenex_4 (- 17179869184))) |main_#t~mem7|) (not (<= .cse9 2147483647))))) (let ((.cse14 (+ v_prenex_13 1))) (let ((.cse12 (* 4294967296 (div .cse14 4294967296))) (.cse11 (mod v_prenex_13 4294967296)) (.cse13 (select v_prenex_12 v_prenex_11)) (.cse10 (mod v_prenex_14 4294967296))) (and (<= .cse10 2147483647) (< .cse11 .cse10) (<= v_prenex_13 (+ .cse12 99998)) (<= .cse11 2147483647) (= (mod (select .cse13 (+ (* 4 (mod .cse14 4294967296)) v_prenex_15)) 4294967296) (mod (select .cse13 (+ (* 4 (mod (+ v_prenex_14 4294967295) 4294967296)) v_prenex_15)) 4294967296)) (<= (+ .cse12 v_prenex_14) (+ (* 4294967296 (div (+ v_prenex_14 (- 1)) 4294967296)) v_prenex_13 1)) (= (select .cse13 (+ (* 4 .cse11) v_prenex_15)) |main_#t~mem8|) (= (select .cse13 (+ (* 4 .cse10) v_prenex_15)) |main_#t~mem7|)))) (let ((.cse19 (+ main_~index2~0 1))) (let ((.cse17 (* 4294967296 (div .cse19 4294967296))) (.cse18 (mod main_~index2~0 4294967296)) (.cse15 (select |#memory_int| |main_~#array~0.base|)) (.cse16 (mod main_~index1~0 4294967296))) (and (= (select .cse15 (+ (* 4 .cse16) |main_~#array~0.offset|)) |main_#t~mem7|) (<= (+ .cse17 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (< .cse18 .cse16) (<= main_~index2~0 (+ .cse17 99998)) (not (<= .cse18 2147483647)) (= (select .cse15 (+ (* 4 .cse18) |main_~#array~0.offset| (- 17179869184))) |main_#t~mem8|) (= (mod (select .cse15 (+ (* 4 (mod .cse19 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select .cse15 (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296)) (<= .cse16 2147483647))))) [2018-11-23 13:09:05,037 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (mod |main_#t~mem7| 4294967296) (mod |main_#t~mem8| 4294967296)) [2018-11-23 13:09:05,277 INFO L256 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {527#true} is VALID [2018-11-23 13:09:05,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {527#true} is VALID [2018-11-23 13:09:05,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2018-11-23 13:09:05,278 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {527#true} {527#true} #54#return; {527#true} is VALID [2018-11-23 13:09:05,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {527#true} call #t~ret11 := main(); {527#true} is VALID [2018-11-23 13:09:05,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {527#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0;~index1~0 := #t~nondet1;havoc #t~nondet1;assume 0 != (if ~index1~0 % 4294967296 < 100000 then 1 else 0);~index2~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~index2~0 % 4294967296 < 100000 then 1 else 0); {529#(and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)))} is VALID [2018-11-23 13:09:05,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {529#(and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)))} assume !!(~index1~0 % 4294967296 < ~index2~0 % 4294967296); {530#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} is VALID [2018-11-23 13:09:05,284 INFO L256 TraceCheckUtils]: 7: Hoare triple {530#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} call __VERIFIER_assert((if ~index1~0 % 4294967296 < 100000 && ~index2~0 % 4294967296 < 100000 then 1 else 0)); {527#true} is VALID [2018-11-23 13:09:05,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2018-11-23 13:09:05,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2018-11-23 13:09:05,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {527#true} assume true; {527#true} is VALID [2018-11-23 13:09:05,286 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {527#true} {530#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} #58#return; {530#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} is VALID [2018-11-23 13:09:05,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {530#(and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div main_~index2~0 4294967296)) main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))} call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~index1~0 % 4294967296 % 4294967296 else ~index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~index2~0 % 4294967296 % 4294967296 else ~index2~0 % 4294967296 % 4294967296 - 4294967296), 4);assume 0 != (if #t~mem3 % 4294967296 == #t~mem4 % 4294967296 then 1 else 0);havoc #t~mem3;havoc #t~mem4;#t~post5 := ~index1~0;~index1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~index2~0;~index2~0 := #t~post6 - 1;havoc #t~post6;~loop_entered~0 := 1; {574#(and (<= (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) 99998)) (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index2~0 1) 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296)))} is VALID [2018-11-23 13:09:05,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {574#(and (<= (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) 99998)) (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index2~0 1) 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296)))} assume !(~index1~0 % 4294967296 < ~index2~0 % 4294967296); {574#(and (<= (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) 99998)) (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index2~0 1) 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296)))} is VALID [2018-11-23 13:09:05,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {574#(and (<= (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) 99998)) (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index2~0 1) 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296)))} assume 0 != ~loop_entered~0 % 4294967296; {574#(and (<= (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) 99998)) (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index2~0 1) 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296)))} is VALID [2018-11-23 13:09:05,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {574#(and (<= (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) 99998)) (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index2~0 1) 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296)))} assume !!(~index2~0 % 4294967296 < ~index1~0 % 4294967296);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~index1~0 % 4294967296 % 4294967296 else ~index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~index2~0 % 4294967296 % 4294967296 else ~index2~0 % 4294967296 % 4294967296 - 4294967296), 4); {532#(and (< (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|) (+ (* 4294967296 (div |main_#t~mem7| 4294967296)) |main_#t~mem8| 1)) (<= (+ (* 4294967296 (div |main_#t~mem7| 4294967296)) |main_#t~mem8|) (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|)))} is VALID [2018-11-23 13:09:05,545 INFO L256 TraceCheckUtils]: 16: Hoare triple {532#(and (< (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|) (+ (* 4294967296 (div |main_#t~mem7| 4294967296)) |main_#t~mem8| 1)) (<= (+ (* 4294967296 (div |main_#t~mem7| 4294967296)) |main_#t~mem8|) (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|)))} call __VERIFIER_assert((if #t~mem7 % 4294967296 == #t~mem8 % 4294967296 then 1 else 0)); {587#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:05,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {587#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {591#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:05,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {591#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {528#false} is VALID [2018-11-23 13:09:05,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {528#false} assume !false; {528#false} is VALID [2018-11-23 13:09:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:05,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:09:05,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2018-11-23 13:09:05,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 13:09:05,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:05,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:09:06,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:06,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:09:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:09:06,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:09:06,029 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 11 states. [2018-11-23 13:09:12,603 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-11-23 13:09:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:25,276 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 13:09:25,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:09:25,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 13:09:25,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:09:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2018-11-23 13:09:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:09:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2018-11-23 13:09:25,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2018-11-23 13:09:27,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:27,062 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:09:27,063 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:09:27,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2018-11-23 13:09:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:09:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:09:27,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:27,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:27,065 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:27,065 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:27,065 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:27,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:27,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:27,066 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:27,066 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:27,067 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:27,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:27,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:27,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:27,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:09:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:09:27,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-23 13:09:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:27,068 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:09:27,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:09:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:27,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:27,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:09:27,232 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 13:09:29,508 WARN L180 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-11-23 13:09:29,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:09:29,618 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:09:29,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:29,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:29,618 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:09:29,619 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:09:29,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:09:29,619 INFO L444 ceAbstractionStarter]: At program point L31-2(lines 31 37) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~index2~0 4294967296)))) (or (let ((.cse0 (+ main_~index2~0 1))) (and (<= (+ (* 4294967296 (div .cse0 4294967296)) main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ .cse1 99998)) (let ((.cse2 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse2 (+ (* 4 (mod .cse0 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select .cse2 (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296))))) (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ .cse1 99999)) (= main_~loop_entered~0 0)))) [2018-11-23 13:09:29,619 INFO L448 ceAbstractionStarter]: For program point L31-3(lines 20 47) no Hoare annotation was computed. [2018-11-23 13:09:29,619 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 19 47) no Hoare annotation was computed. [2018-11-23 13:09:29,620 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 19 47) no Hoare annotation was computed. [2018-11-23 13:09:29,620 INFO L444 ceAbstractionStarter]: At program point L40-2(lines 40 44) the Hoare annotation is: (or (let ((.cse2 (+ main_~index2~0 1))) (let ((.cse0 (* 4294967296 (div .cse2 4294967296)))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ .cse0 99998)) (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse1 (+ (* 4 (mod .cse2 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296)))))) (let ((.cse3 (* 4294967296 (div main_~index2~0 4294967296)))) (and (<= main_~index2~0 (+ .cse3 99999)) (<= (+ .cse3 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296))))))) [2018-11-23 13:09:29,620 INFO L444 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (or (and (<= main_~index2~0 (+ .cse0 99999)) (= main_~loop_entered~0 0)) (<= main_~index2~0 (+ .cse0 99998))) (<= (+ .cse0 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))) [2018-11-23 13:09:29,620 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-23 13:09:29,621 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 19 47) the Hoare annotation is: true [2018-11-23 13:09:29,621 INFO L444 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (let ((.cse4 (+ main_~index2~0 1))) (let ((.cse0 (* 4294967296 (div .cse4 4294967296))) (.cse2 (* 4294967296 (div |main_#t~mem7| 4294967296))) (.cse1 (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (< .cse1 (+ .cse2 |main_#t~mem8| 1)) (<= main_~index2~0 (+ .cse0 99998)) (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse3 (+ (* 4 (mod .cse4 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select .cse3 (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296))) (<= (+ .cse2 |main_#t~mem8|) .cse1)))) [2018-11-23 13:09:29,621 INFO L448 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2018-11-23 13:09:29,621 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2018-11-23 13:09:29,621 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2018-11-23 13:09:29,622 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-23 13:09:29,622 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2018-11-23 13:09:29,622 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2018-11-23 13:09:29,622 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2018-11-23 13:09:29,622 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2018-11-23 13:09:29,624 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:09:29,630 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2018-11-23 13:09:29,630 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:09:29,630 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:29,630 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 13:09:29,631 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 13:09:29,633 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2018-11-23 13:09:29,633 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2018-11-23 13:09:29,633 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:09:29,633 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:29,633 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 13:09:29,633 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 13:09:29,633 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 13:09:29,634 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 13:09:29,634 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 13:09:29,634 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 13:09:29,634 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-23 13:09:29,634 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-23 13:09:29,905 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-23 13:09:29,905 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 13:09:29,905 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:29,905 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:29,906 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-23 13:09:29,906 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:09:29,906 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-23 13:09:29,906 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:09:29,906 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:09:29,913 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:29,914 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:29,918 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:29,918 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:29,923 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:29,923 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:29,926 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:29,927 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:29,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:09:29 BoogieIcfgContainer [2018-11-23 13:09:29,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:09:29,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:09:29,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:09:29,931 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:09:29,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:45" (3/4) ... [2018-11-23 13:09:29,935 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:09:29,942 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:09:29,943 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:09:29,943 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:09:29,947 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 13:09:29,947 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:09:29,947 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:09:30,009 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i-witness.graphml [2018-11-23 13:09:30,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:09:30,011 INFO L168 Benchmark]: Toolchain (without parser) took 45608.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -269.0 MB). Peak memory consumption was 482.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:30,012 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:30,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:30,013 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:30,014 INFO L168 Benchmark]: Boogie Preprocessor took 62.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:30,015 INFO L168 Benchmark]: RCFGBuilder took 764.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:30,016 INFO L168 Benchmark]: TraceAbstraction took 44286.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 503.7 MB). Peak memory consumption was 503.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:30,016 INFO L168 Benchmark]: Witness Printer took 79.62 ms. Allocated memory is still 2.3 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:30,019 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 376.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 764.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44286.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 503.7 MB). Peak memory consumption was 503.7 MB. Max. memory is 7.1 GB. * Witness Printer took 79.62 ms. Allocated memory is still 2.3 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant [2018-11-23 13:09:30,027 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:30,027 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:30,028 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:30,028 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((index2 + 1) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2 + 1 && index2 <= 4294967296 * ((index2 + 1) / 4294967296) + 99998) && unknown-#memory_int-unknown[array][4 * ((index2 + 1) % 4294967296) + array] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) || (index2 <= 4294967296 * (index2 / 4294967296) + 99999 && 4294967296 * (index2 / 4294967296) + index1 + 1 <= index2 + 4294967296 * (index1 / 4294967296)) - InvariantResult [Line: 31]: Loop Invariant [2018-11-23 13:09:30,029 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:30,030 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:30,031 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:30,031 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((index2 + 1) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2 + 1 && index2 <= 4294967296 * (index2 / 4294967296) + 99998) && unknown-#memory_int-unknown[array][4 * ((index2 + 1) % 4294967296) + array] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) || ((index1 <= 4294967296 * (index1 / 4294967296) + 99999 && index2 <= 4294967296 * (index2 / 4294967296) + 99999) && loop_entered == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 43.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 23.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 45 SDslu, 166 SDs, 0 SdLazy, 149 SolverSat, 26 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 313 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 155 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 30787 SizeOfPredicates, 7 NumberOfNonLiveVariables, 73 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 9/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...