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.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:09:01,434 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:09:01,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:09:01,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:09:01,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:09:01,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:09:01,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:09:01,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:09:01,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:09:01,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:09:01,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:09:01,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:09:01,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:09:01,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:09:01,469 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:09:01,470 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:09:01,471 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:09:01,473 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:09:01,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:09:01,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:09:01,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:09:01,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:09:01,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:09:01,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:09:01,484 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:09:01,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:09:01,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:09:01,486 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:09:01,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:09:01,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:09:01,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:09:01,491 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:09:01,491 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:09:01,491 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:09:01,492 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:09:01,493 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:09:01,493 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:09:01,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:09:01,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:09:01,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:09:01,508 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:09:01,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:09:01,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:09:01,509 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:09:01,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:09:01,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:09:01,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:09:01,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:09:01,511 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:09:01,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:09:01,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:09:01,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:09:01,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:09:01,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:09:01,512 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:09:01,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:09:01,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:09:01,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:09:01,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:09:01,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:09:01,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:09:01,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:09:01,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:09:01,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:09:01,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:09:01,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:09:01,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:09:01,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:09:01,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:09:01,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:09:01,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:09:01,574 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:09:01,575 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:09:01,576 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.i.v+lhb-reducer.c [2018-11-23 13:09:01,633 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b89cb8cf/f81885c595d14c64b88988c7e51dcb69/FLAG4309514a7 [2018-11-23 13:09:02,063 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:09:02,064 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-23 13:09:02,071 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b89cb8cf/f81885c595d14c64b88988c7e51dcb69/FLAG4309514a7 [2018-11-23 13:09:02,408 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b89cb8cf/f81885c595d14c64b88988c7e51dcb69 [2018-11-23 13:09:02,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:09:02,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:09:02,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:02,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:09:02,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:09:02,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:02" (1/1) ... [2018-11-23 13:09:02,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610470f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02, skipping insertion in model container [2018-11-23 13:09:02,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:02" (1/1) ... [2018-11-23 13:09:02,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:09:02,486 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:09:02,776 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:02,787 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:09:02,833 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:02,856 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:09:02,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02 WrapperNode [2018-11-23 13:09:02,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:02,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:02,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:09:02,858 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:09:02,868 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:09:02" (1/1) ... [2018-11-23 13:09:02,881 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:09:02" (1/1) ... [2018-11-23 13:09:02,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:02,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:09:02,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:09:02,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:09:02,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02" (1/1) ... [2018-11-23 13:09:02,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02" (1/1) ... [2018-11-23 13:09:02,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02" (1/1) ... [2018-11-23 13:09:02,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02" (1/1) ... [2018-11-23 13:09:02,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02" (1/1) ... [2018-11-23 13:09:02,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02" (1/1) ... [2018-11-23 13:09:02,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02" (1/1) ... [2018-11-23 13:09:02,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:09:02,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:09:02,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:09:02,944 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:09:02,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02" (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:09:03,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:09:03,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:09:03,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:09:03,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:09:03,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:09:03,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:09:03,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:09:03,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:09:03,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:09:04,091 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:09:04,092 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:09:04,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:04 BoogieIcfgContainer [2018-11-23 13:09:04,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:09:04,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:09:04,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:09:04,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:09:04,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:09:02" (1/3) ... [2018-11-23 13:09:04,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be734b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:04, skipping insertion in model container [2018-11-23 13:09:04,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:02" (2/3) ... [2018-11-23 13:09:04,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be734b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:04, skipping insertion in model container [2018-11-23 13:09:04,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:04" (3/3) ... [2018-11-23 13:09:04,102 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-23 13:09:04,112 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:09:04,119 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 13:09:04,137 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 13:09:04,171 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:09:04,172 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:09:04,172 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:09:04,172 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:09:04,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:09:04,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:09:04,173 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:09:04,173 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:09:04,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:09:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 13:09:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:09:04,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:04,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:04,202 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:04,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2018-11-23 13:09:04,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:04,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:04,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:04,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:04,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 13:09:04,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__tmp_155_0~0 := 0;~__return_136~0 := 0; {45#true} is VALID [2018-11-23 13:09:04,478 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 13:09:04,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #107#return; {45#true} is VALID [2018-11-23 13:09:04,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret9 := main(); {45#true} is VALID [2018-11-23 13:09:04,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {47#(= main_~main__loop_entered~0 0)} is VALID [2018-11-23 13:09:04,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {47#(= main_~main__loop_entered~0 0)} assume ~main__index1~0 % 4294967296 < 100000;~main__index2~0 := #t~nondet2;havoc #t~nondet2; {47#(= main_~main__loop_entered~0 0)} is VALID [2018-11-23 13:09:04,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {47#(= main_~main__loop_entered~0 0)} assume ~main__index2~0 % 4294967296 < 100000; {47#(= main_~main__loop_entered~0 0)} is VALID [2018-11-23 13:09:04,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {47#(= main_~main__loop_entered~0 0)} assume !(~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296); {47#(= main_~main__loop_entered~0 0)} is VALID [2018-11-23 13:09:04,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {47#(= main_~main__loop_entered~0 0)} assume !(0 == ~main__loop_entered~0 % 4294967296); {46#false} is VALID [2018-11-23 13:09:04,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume ~main__index2~0 % 4294967296 < ~main__index1~0 % 4294967296;havoc ~__tmp_4~0;call #t~mem7 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index1~0 % 4294967296 % 4294967296 else ~main__index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem8 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index2~0 % 4294967296 % 4294967296 else ~main__index2~0 % 4294967296 % 4294967296 - 4294967296), 4);~__tmp_4~0 := (if #t~mem7 % 4294967296 == #t~mem8 % 4294967296 then 1 else 0);havoc #t~mem7;havoc #t~mem8;havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {46#false} is VALID [2018-11-23 13:09:04,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} assume 0 == ~__VERIFIER_assert__cond~3; {46#false} is VALID [2018-11-23 13:09:04,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 13:09:04,499 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:09:04,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:04,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:09:04,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:09:04,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:04,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:09:04,606 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:09:04,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:09:04,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:09:04,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:09:04,622 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-11-23 13:09:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:05,079 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-11-23 13:09:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:09:05,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:09:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:09:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 13:09:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:09:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 13:09:05,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 13:09:05,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:05,395 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:09:05,395 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:09:05,400 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:09:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:09:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 13:09:05,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:05,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 13:09:05,609 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 13:09:05,610 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 13:09:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:05,615 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 13:09:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 13:09:05,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:05,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:05,618 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 13:09:05,619 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 13:09:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:05,632 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 13:09:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 13:09:05,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:05,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:05,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:05,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:09:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 13:09:05,646 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2018-11-23 13:09:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:05,646 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 13:09:05,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:09:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 13:09:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:09:05,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:05,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:05,648 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:05,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2018-11-23 13:09:05,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:05,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:05,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:05,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {233#true} call ULTIMATE.init(); {233#true} is VALID [2018-11-23 13:09:05,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {233#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__tmp_155_0~0 := 0;~__return_136~0 := 0; {233#true} is VALID [2018-11-23 13:09:05,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {233#true} assume true; {233#true} is VALID [2018-11-23 13:09:05,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {233#true} {233#true} #107#return; {233#true} is VALID [2018-11-23 13:09:05,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {233#true} call #t~ret9 := main(); {233#true} is VALID [2018-11-23 13:09:05,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {233#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {233#true} is VALID [2018-11-23 13:09:05,779 INFO L273 TraceCheckUtils]: 6: Hoare triple {233#true} assume ~main__index1~0 % 4294967296 < 100000;~main__index2~0 := #t~nondet2;havoc #t~nondet2; {233#true} is VALID [2018-11-23 13:09:05,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {233#true} assume ~main__index2~0 % 4294967296 < 100000; {233#true} is VALID [2018-11-23 13:09:05,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#true} assume ~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296;havoc ~main____CPAchecker_TMP_0~0; {233#true} is VALID [2018-11-23 13:09:05,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {233#true} assume ~main__index1~0 % 4294967296 < 100000; {233#true} is VALID [2018-11-23 13:09:05,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {233#true} assume ~main__index2~0 % 4294967296 < 100000;~main____CPAchecker_TMP_0~0 := 1; {235#(= main_~main____CPAchecker_TMP_0~0 1)} is VALID [2018-11-23 13:09:05,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {235#(= main_~main____CPAchecker_TMP_0~0 1)} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {236#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:09:05,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {236#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {234#false} is VALID [2018-11-23 13:09:05,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {234#false} assume !false; {234#false} is VALID [2018-11-23 13:09:05,835 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:09:05,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:05,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:09:05,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 13:09:05,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:05,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:09:05,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:05,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:09:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:09:05,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:09:05,869 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2018-11-23 13:09:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:06,151 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-23 13:09:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:09:06,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 13:09:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:09:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 13:09:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:09:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 13:09:06,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2018-11-23 13:09:06,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:06,290 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:09:06,291 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:09:06,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:09:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:09:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-11-23 13:09:06,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:06,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 34 states. [2018-11-23 13:09:06,324 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 34 states. [2018-11-23 13:09:06,324 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 34 states. [2018-11-23 13:09:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:06,329 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 13:09:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 13:09:06,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:06,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:06,330 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 51 states. [2018-11-23 13:09:06,331 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 51 states. [2018-11-23 13:09:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:06,335 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 13:09:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 13:09:06,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:06,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:06,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:06,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:09:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 13:09:06,342 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2018-11-23 13:09:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:06,343 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 13:09:06,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:09:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 13:09:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:09:06,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:06,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:06,344 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:06,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2018-11-23 13:09:06,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:06,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:06,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:06,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2018-11-23 13:09:06,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {460#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__tmp_155_0~0 := 0;~__return_136~0 := 0; {460#true} is VALID [2018-11-23 13:09:06,406 INFO L273 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-23 13:09:06,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #107#return; {460#true} is VALID [2018-11-23 13:09:06,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {460#true} call #t~ret9 := main(); {460#true} is VALID [2018-11-23 13:09:06,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {460#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {460#true} is VALID [2018-11-23 13:09:06,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {460#true} assume ~main__index1~0 % 4294967296 < 100000;~main__index2~0 := #t~nondet2;havoc #t~nondet2; {462#(<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999))} is VALID [2018-11-23 13:09:06,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {462#(<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999))} assume ~main__index2~0 % 4294967296 < 100000; {462#(<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999))} is VALID [2018-11-23 13:09:06,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {462#(<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999))} assume ~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296;havoc ~main____CPAchecker_TMP_0~0; {462#(<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999))} is VALID [2018-11-23 13:09:06,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {462#(<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999))} assume !(~main__index1~0 % 4294967296 < 100000); {461#false} is VALID [2018-11-23 13:09:06,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {461#false} ~main____CPAchecker_TMP_0~0 := 0; {461#false} is VALID [2018-11-23 13:09:06,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {461#false} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {461#false} is VALID [2018-11-23 13:09:06,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {461#false} assume 0 == ~__VERIFIER_assert__cond~0; {461#false} is VALID [2018-11-23 13:09:06,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {461#false} assume !false; {461#false} is VALID [2018-11-23 13:09:06,414 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:09:06,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:06,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:09:06,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 13:09:06,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:06,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:09:06,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:06,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:09:06,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:09:06,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:09:06,450 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2018-11-23 13:09:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:06,668 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 13:09:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:09:06,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 13:09:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:09:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 13:09:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:09:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 13:09:06,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-23 13:09:06,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:06,804 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:09:06,805 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:09:06,805 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:09:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:09:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-11-23 13:09:06,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:06,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 34 states. [2018-11-23 13:09:06,869 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 34 states. [2018-11-23 13:09:06,869 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 34 states. [2018-11-23 13:09:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:06,874 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 13:09:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 13:09:06,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:06,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:06,875 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 41 states. [2018-11-23 13:09:06,875 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 41 states. [2018-11-23 13:09:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:06,878 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 13:09:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 13:09:06,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:06,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:06,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:06,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:09:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 13:09:06,882 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2018-11-23 13:09:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:06,882 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 13:09:06,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:09:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 13:09:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:09:06,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:06,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:06,884 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:06,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2018-11-23 13:09:06,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:06,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:06,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {677#true} is VALID [2018-11-23 13:09:06,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {677#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__tmp_155_0~0 := 0;~__return_136~0 := 0; {677#true} is VALID [2018-11-23 13:09:06,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2018-11-23 13:09:06,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #107#return; {677#true} is VALID [2018-11-23 13:09:06,988 INFO L256 TraceCheckUtils]: 4: Hoare triple {677#true} call #t~ret9 := main(); {677#true} is VALID [2018-11-23 13:09:06,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {677#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {677#true} is VALID [2018-11-23 13:09:06,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {677#true} assume ~main__index1~0 % 4294967296 < 100000;~main__index2~0 := #t~nondet2;havoc #t~nondet2; {677#true} is VALID [2018-11-23 13:09:06,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {677#true} assume ~main__index2~0 % 4294967296 < 100000; {679#(<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999))} is VALID [2018-11-23 13:09:06,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#(<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999))} assume ~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296;havoc ~main____CPAchecker_TMP_0~0; {679#(<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999))} is VALID [2018-11-23 13:09:06,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {679#(<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999))} assume ~main__index1~0 % 4294967296 < 100000; {679#(<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999))} is VALID [2018-11-23 13:09:06,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {679#(<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999))} assume !(~main__index2~0 % 4294967296 < 100000); {678#false} is VALID [2018-11-23 13:09:06,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {678#false} ~main____CPAchecker_TMP_0~0 := 0; {678#false} is VALID [2018-11-23 13:09:06,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {678#false} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {678#false} is VALID [2018-11-23 13:09:06,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {678#false} assume 0 == ~__VERIFIER_assert__cond~0; {678#false} is VALID [2018-11-23 13:09:06,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {678#false} assume !false; {678#false} is VALID [2018-11-23 13:09:07,000 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:09:07,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:07,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:09:07,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 13:09:07,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:07,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:09:07,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:07,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:09:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:09:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:09:07,030 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2018-11-23 13:09:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:07,173 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 13:09:07,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:09:07,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 13:09:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:09:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 13:09:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:09:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 13:09:07,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-23 13:09:07,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:07,266 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:09:07,266 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:09:07,267 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:09:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:09:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-23 13:09:07,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:07,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 29 states. [2018-11-23 13:09:07,280 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 29 states. [2018-11-23 13:09:07,280 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 29 states. [2018-11-23 13:09:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:07,282 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 13:09:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 13:09:07,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:07,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:07,284 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 35 states. [2018-11-23 13:09:07,284 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 35 states. [2018-11-23 13:09:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:07,286 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 13:09:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 13:09:07,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:07,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:07,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:07,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:09:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 13:09:07,293 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-11-23 13:09:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:07,293 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 13:09:07,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:09:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 13:09:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:09:07,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:07,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:07,294 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:07,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2018-11-23 13:09:07,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:07,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:07,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:08,609 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 11 [2018-11-23 13:09:09,859 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 19 [2018-11-23 13:09:10,566 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 21 [2018-11-23 13:09:11,096 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 36 [2018-11-23 13:09:11,832 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 41 [2018-11-23 13:09:12,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2018-11-23 13:09:12,221 INFO L273 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__tmp_155_0~0 := 0;~__return_136~0 := 0; {866#true} is VALID [2018-11-23 13:09:12,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2018-11-23 13:09:12,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #107#return; {866#true} is VALID [2018-11-23 13:09:12,222 INFO L256 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret9 := main(); {866#true} is VALID [2018-11-23 13:09:12,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {866#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {868#(= |main_~#main__array~0.offset| 0)} is VALID [2018-11-23 13:09:12,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {868#(= |main_~#main__array~0.offset| 0)} assume ~main__index1~0 % 4294967296 < 100000;~main__index2~0 := #t~nondet2;havoc #t~nondet2; {869#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)))} is VALID [2018-11-23 13:09:12,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {869#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)))} assume ~main__index2~0 % 4294967296 < 100000; {870#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)))} is VALID [2018-11-23 13:09:12,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {870#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)))} assume ~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296;havoc ~main____CPAchecker_TMP_0~0; {871#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:12,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {871#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} assume ~main__index1~0 % 4294967296 < 100000; {871#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:12,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {871#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} assume ~main__index2~0 % 4294967296 < 100000;~main____CPAchecker_TMP_0~0 := 1; {872#(and (= |main_~#main__array~0.offset| 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:12,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {872#(and (= |main_~#main__array~0.offset| 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {873#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (= main_~__VERIFIER_assert__cond~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:12,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {873#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (= main_~__VERIFIER_assert__cond~0 1) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} assume !(0 == ~__VERIFIER_assert__cond~0);~__tmp_155_0~0 := ~main____CPAchecker_TMP_0~0; {871#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:12,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {871#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_155_0~0;call #t~mem3 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index1~0 % 4294967296 % 4294967296 else ~main__index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem4 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index2~0 % 4294967296 % 4294967296 else ~main__index2~0 % 4294967296 % 4294967296 - 4294967296), 4); {874#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (= |main_#t~mem4| (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))) (= (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) |main_#t~mem3|) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:12,257 INFO L273 TraceCheckUtils]: 14: Hoare triple {874#(and (= |main_~#main__array~0.offset| 0) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (= |main_#t~mem4| (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))) (= (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) |main_#t~mem3|) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} assume #t~mem3 % 4294967296 == #t~mem4 % 4294967296;havoc #t~mem4;havoc #t~mem3;~main____CPAchecker_TMP_1~0 := ~main__index1~0;~main__index1~0 := 1 + ~main__index1~0;~main____CPAchecker_TMP_2~0 := ~main__index2~0;~main__index2~0 := ~main__index2~0 - 1;~main__loop_entered~0 := 1; {875#(and (= |main_~#main__array~0.offset| 0) (or (and (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))) (+ (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)))) (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))))) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296))) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 100000)))} is VALID [2018-11-23 13:09:12,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {875#(and (= |main_~#main__array~0.offset| 0) (or (and (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))) (+ (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)))) (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))))) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296))) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 100000)))} assume !(~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296); {875#(and (= |main_~#main__array~0.offset| 0) (or (and (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))) (+ (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)))) (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))))) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296))) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 100000)))} is VALID [2018-11-23 13:09:12,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {875#(and (= |main_~#main__array~0.offset| 0) (or (and (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))) (+ (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)))) (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))))) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296))) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 100000)))} assume !(0 == ~main__loop_entered~0 % 4294967296); {875#(and (= |main_~#main__array~0.offset| 0) (or (and (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))) (+ (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)))) (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))))) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296))) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 100000)))} is VALID [2018-11-23 13:09:12,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {875#(and (= |main_~#main__array~0.offset| 0) (or (and (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))) (+ (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)))) (<= (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296)))) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (+ (* 4294967296 (div (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|)) 4294967296)) (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) (div main_~main__index2~0 4294967296))))))) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296))) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 100000)))} assume ~main__index2~0 % 4294967296 < ~main__index1~0 % 4294967296;havoc ~__tmp_3~0;call #t~mem5 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index1~0 % 4294967296 % 4294967296 else ~main__index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem6 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index2~0 % 4294967296 % 4294967296 else ~main__index2~0 % 4294967296 % 4294967296 - 4294967296), 4);~__tmp_3~0 := (if #t~mem5 % 4294967296 == #t~mem6 % 4294967296 then 1 else 0);havoc #t~mem6;havoc #t~mem5;havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {876#(not (= 0 main_~__VERIFIER_assert__cond~2))} is VALID [2018-11-23 13:09:12,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {876#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume 0 == ~__VERIFIER_assert__cond~2; {867#false} is VALID [2018-11-23 13:09:12,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#false} assume !false; {867#false} is VALID [2018-11-23 13:09:12,277 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:09:12,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:12,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 13:09:12,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 13:09:12,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:12,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:09:12,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:12,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:09:12,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:09:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:09:12,358 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 11 states. [2018-11-23 13:09:13,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:13,319 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-23 13:09:13,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:09:13,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 13:09:13,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:09:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-23 13:09:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:09:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-23 13:09:13,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2018-11-23 13:09:13,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:13,597 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:09:13,597 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:09:13,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:09:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:09:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-23 13:09:13,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:13,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 30 states. [2018-11-23 13:09:13,636 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 30 states. [2018-11-23 13:09:13,636 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 30 states. [2018-11-23 13:09:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:13,638 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 13:09:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 13:09:13,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:13,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:13,640 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 33 states. [2018-11-23 13:09:13,640 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 33 states. [2018-11-23 13:09:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:13,642 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 13:09:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 13:09:13,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:13,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:13,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:13,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:09:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 13:09:13,647 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2018-11-23 13:09:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:13,647 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 13:09:13,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:09:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 13:09:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:09:13,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:13,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:13,651 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:13,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:13,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2018-11-23 13:09:13,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:13,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:13,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:13,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:13,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:14,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2018-11-23 13:09:14,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {1061#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__tmp_155_0~0 := 0;~__return_136~0 := 0; {1061#true} is VALID [2018-11-23 13:09:14,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-23 13:09:14,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #107#return; {1061#true} is VALID [2018-11-23 13:09:14,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret9 := main(); {1061#true} is VALID [2018-11-23 13:09:14,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {1061#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {1061#true} is VALID [2018-11-23 13:09:14,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#true} assume ~main__index1~0 % 4294967296 < 100000;~main__index2~0 := #t~nondet2;havoc #t~nondet2; {1061#true} is VALID [2018-11-23 13:09:14,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {1061#true} assume ~main__index2~0 % 4294967296 < 100000; {1061#true} is VALID [2018-11-23 13:09:14,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {1061#true} assume ~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296;havoc ~main____CPAchecker_TMP_0~0; {1061#true} is VALID [2018-11-23 13:09:14,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {1061#true} assume ~main__index1~0 % 4294967296 < 100000; {1061#true} is VALID [2018-11-23 13:09:14,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {1061#true} assume ~main__index2~0 % 4294967296 < 100000;~main____CPAchecker_TMP_0~0 := 1; {1063#(= main_~main____CPAchecker_TMP_0~0 1)} is VALID [2018-11-23 13:09:14,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {1063#(= main_~main____CPAchecker_TMP_0~0 1)} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1064#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 13:09:14,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {1064#(= main_~__VERIFIER_assert__cond~0 1)} assume !(0 == ~__VERIFIER_assert__cond~0);~__tmp_155_0~0 := ~main____CPAchecker_TMP_0~0; {1061#true} is VALID [2018-11-23 13:09:14,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {1061#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_155_0~0;call #t~mem3 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index1~0 % 4294967296 % 4294967296 else ~main__index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem4 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index2~0 % 4294967296 % 4294967296 else ~main__index2~0 % 4294967296 % 4294967296 - 4294967296), 4); {1061#true} is VALID [2018-11-23 13:09:14,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {1061#true} assume #t~mem3 % 4294967296 == #t~mem4 % 4294967296;havoc #t~mem4;havoc #t~mem3;~main____CPAchecker_TMP_1~0 := ~main__index1~0;~main__index1~0 := 1 + ~main__index1~0;~main____CPAchecker_TMP_2~0 := ~main__index2~0;~main__index2~0 := ~main__index2~0 - 1;~main__loop_entered~0 := 1; {1061#true} is VALID [2018-11-23 13:09:14,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {1061#true} assume ~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296;havoc ~main____CPAchecker_TMP_0~1; {1061#true} is VALID [2018-11-23 13:09:14,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {1061#true} assume ~main__index1~0 % 4294967296 < 100000; {1061#true} is VALID [2018-11-23 13:09:14,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {1061#true} assume ~main__index2~0 % 4294967296 < 100000;~main____CPAchecker_TMP_0~1 := 1; {1065#(not (= 0 main_~main____CPAchecker_TMP_0~1))} is VALID [2018-11-23 13:09:14,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {1065#(not (= 0 main_~main____CPAchecker_TMP_0~1))} havoc ~__tmp_2~0;~__tmp_2~0 := ~main____CPAchecker_TMP_0~1;havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1066#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-23 13:09:14,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {1066#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {1062#false} is VALID [2018-11-23 13:09:14,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2018-11-23 13:09:14,586 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:09:14,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:14,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:09:14,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:09:14,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:14,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:09:14,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:14,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:09:14,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:09:14,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:09:14,620 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-11-23 13:09:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:15,173 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 13:09:15,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:09:15,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:09:15,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:09:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-23 13:09:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:09:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-23 13:09:15,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2018-11-23 13:09:15,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:15,279 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:09:15,279 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:09:15,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:09:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:09:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2018-11-23 13:09:15,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:15,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 28 states. [2018-11-23 13:09:15,389 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 28 states. [2018-11-23 13:09:15,389 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 28 states. [2018-11-23 13:09:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:15,391 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 13:09:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 13:09:15,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:15,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:15,392 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 42 states. [2018-11-23 13:09:15,392 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 42 states. [2018-11-23 13:09:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:15,395 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 13:09:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 13:09:15,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:15,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:15,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:15,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:09:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 13:09:15,397 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-11-23 13:09:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:15,397 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 13:09:15,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:09:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 13:09:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:09:15,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:15,398 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:15,399 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:15,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2018-11-23 13:09:15,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:15,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:15,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:15,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:16,147 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-11-23 13:09:18,498 INFO L256 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2018-11-23 13:09:18,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {1260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__tmp_155_0~0 := 0;~__return_136~0 := 0; {1260#true} is VALID [2018-11-23 13:09:18,498 INFO L273 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 13:09:18,499 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #107#return; {1260#true} is VALID [2018-11-23 13:09:18,499 INFO L256 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret9 := main(); {1260#true} is VALID [2018-11-23 13:09:18,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {1260#true} is VALID [2018-11-23 13:09:18,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {1260#true} assume ~main__index1~0 % 4294967296 < 100000;~main__index2~0 := #t~nondet2;havoc #t~nondet2; {1260#true} is VALID [2018-11-23 13:09:18,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {1260#true} assume ~main__index2~0 % 4294967296 < 100000; {1262#(<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999))} is VALID [2018-11-23 13:09:18,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {1262#(<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999))} assume ~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296;havoc ~main____CPAchecker_TMP_0~0; {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:18,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} assume ~main__index1~0 % 4294967296 < 100000; {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:18,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} assume ~main__index2~0 % 4294967296 < 100000;~main____CPAchecker_TMP_0~0 := 1; {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:18,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:18,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} assume !(0 == ~__VERIFIER_assert__cond~0);~__tmp_155_0~0 := ~main____CPAchecker_TMP_0~0; {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:18,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_155_0~0;call #t~mem3 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index1~0 % 4294967296 % 4294967296 else ~main__index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem4 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index2~0 % 4294967296 % 4294967296 else ~main__index2~0 % 4294967296 % 4294967296 - 4294967296), 4); {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} is VALID [2018-11-23 13:09:20,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {1263#(and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))} assume #t~mem3 % 4294967296 == #t~mem4 % 4294967296;havoc #t~mem4;havoc #t~mem3;~main____CPAchecker_TMP_1~0 := ~main__index1~0;~main__index1~0 := 1 + ~main__index1~0;~main____CPAchecker_TMP_2~0 := ~main__index2~0;~main__index2~0 := ~main__index2~0 - 1;~main__loop_entered~0 := 1; {1264#(<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))} is UNKNOWN [2018-11-23 13:09:20,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {1264#(<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))} assume !(~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296); {1264#(<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))} is VALID [2018-11-23 13:09:20,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {1264#(<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))} assume !(0 == ~main__loop_entered~0 % 4294967296); {1264#(<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))} is VALID [2018-11-23 13:09:20,611 INFO L273 TraceCheckUtils]: 17: Hoare triple {1264#(<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))} assume ~main__index2~0 % 4294967296 < ~main__index1~0 % 4294967296;havoc ~__tmp_3~0;call #t~mem5 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index1~0 % 4294967296 % 4294967296 else ~main__index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem6 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index2~0 % 4294967296 % 4294967296 else ~main__index2~0 % 4294967296 % 4294967296 - 4294967296), 4);~__tmp_3~0 := (if #t~mem5 % 4294967296 == #t~mem6 % 4294967296 then 1 else 0);havoc #t~mem6;havoc #t~mem5;havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1264#(<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))} is VALID [2018-11-23 13:09:20,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {1264#(<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))} assume !(0 == ~__VERIFIER_assert__cond~2); {1264#(<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))} is VALID [2018-11-23 13:09:20,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {1264#(<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998))} ~main____CPAchecker_TMP_3~0 := ~main__index2~0;~main__index2~0 := 1 + ~main__index2~0;~main____CPAchecker_TMP_4~0 := ~main__index1~0;~main__index1~0 := ~main__index1~0 - 1; {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} is VALID [2018-11-23 13:09:20,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} assume ~main__index2~0 % 4294967296 < ~main__index1~0 % 4294967296;havoc ~__tmp_3~0;call #t~mem5 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index1~0 % 4294967296 % 4294967296 else ~main__index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem6 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index2~0 % 4294967296 % 4294967296 else ~main__index2~0 % 4294967296 % 4294967296 - 4294967296), 4);~__tmp_3~0 := (if #t~mem5 % 4294967296 == #t~mem6 % 4294967296 then 1 else 0);havoc #t~mem6;havoc #t~mem5;havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1261#false} is VALID [2018-11-23 13:09:20,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {1261#false} assume 0 == ~__VERIFIER_assert__cond~2; {1261#false} is VALID [2018-11-23 13:09:20,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2018-11-23 13:09:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:20,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:20,619 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:09:20,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:20,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:20,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2018-11-23 13:09:20,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {1260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__tmp_155_0~0 := 0;~__return_136~0 := 0; {1260#true} is VALID [2018-11-23 13:09:20,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 13:09:20,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #107#return; {1260#true} is VALID [2018-11-23 13:09:20,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret9 := main(); {1260#true} is VALID [2018-11-23 13:09:20,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {1260#true} is VALID [2018-11-23 13:09:20,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {1260#true} assume ~main__index1~0 % 4294967296 < 100000;~main__index2~0 := #t~nondet2;havoc #t~nondet2; {1260#true} is VALID [2018-11-23 13:09:20,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {1260#true} assume ~main__index2~0 % 4294967296 < 100000; {1260#true} is VALID [2018-11-23 13:09:20,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {1260#true} assume ~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296;havoc ~main____CPAchecker_TMP_0~0; {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} is VALID [2018-11-23 13:09:20,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} assume ~main__index1~0 % 4294967296 < 100000; {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} is VALID [2018-11-23 13:09:20,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} assume ~main__index2~0 % 4294967296 < 100000;~main____CPAchecker_TMP_0~0 := 1; {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} is VALID [2018-11-23 13:09:20,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} is VALID [2018-11-23 13:09:20,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} assume !(0 == ~__VERIFIER_assert__cond~0);~__tmp_155_0~0 := ~main____CPAchecker_TMP_0~0; {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} is VALID [2018-11-23 13:09:20,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_155_0~0;call #t~mem3 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index1~0 % 4294967296 % 4294967296 else ~main__index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem4 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index2~0 % 4294967296 % 4294967296 else ~main__index2~0 % 4294967296 % 4294967296 - 4294967296), 4); {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} is VALID [2018-11-23 13:09:20,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} assume #t~mem3 % 4294967296 == #t~mem4 % 4294967296;havoc #t~mem4;havoc #t~mem3;~main____CPAchecker_TMP_1~0 := ~main__index1~0;~main__index1~0 := 1 + ~main__index1~0;~main____CPAchecker_TMP_2~0 := ~main__index2~0;~main__index2~0 := ~main__index2~0 - 1;~main__loop_entered~0 := 1; {1311#(<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))} is VALID [2018-11-23 13:09:20,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {1311#(<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))} assume !(~main__index1~0 % 4294967296 < ~main__index2~0 % 4294967296); {1311#(<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))} is VALID [2018-11-23 13:09:20,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {1311#(<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))} assume !(0 == ~main__loop_entered~0 % 4294967296); {1311#(<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))} is VALID [2018-11-23 13:09:20,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {1311#(<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))} assume ~main__index2~0 % 4294967296 < ~main__index1~0 % 4294967296;havoc ~__tmp_3~0;call #t~mem5 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index1~0 % 4294967296 % 4294967296 else ~main__index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem6 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index2~0 % 4294967296 % 4294967296 else ~main__index2~0 % 4294967296 % 4294967296 - 4294967296), 4);~__tmp_3~0 := (if #t~mem5 % 4294967296 == #t~mem6 % 4294967296 then 1 else 0);havoc #t~mem6;havoc #t~mem5;havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1311#(<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))} is VALID [2018-11-23 13:09:20,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {1311#(<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))} assume !(0 == ~__VERIFIER_assert__cond~2); {1311#(<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))} is VALID [2018-11-23 13:09:20,853 INFO L273 TraceCheckUtils]: 19: Hoare triple {1311#(<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1))} ~main____CPAchecker_TMP_3~0 := ~main__index2~0;~main__index2~0 := 1 + ~main__index2~0;~main____CPAchecker_TMP_4~0 := ~main__index1~0;~main__index1~0 := ~main__index1~0 - 1; {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} is VALID [2018-11-23 13:09:20,854 INFO L273 TraceCheckUtils]: 20: Hoare triple {1265#(<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))} assume ~main__index2~0 % 4294967296 < ~main__index1~0 % 4294967296;havoc ~__tmp_3~0;call #t~mem5 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index1~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index1~0 % 4294967296 % 4294967296 else ~main__index1~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem6 := read~int(~#main__array~0.base, ~#main__array~0.offset + 4 * (if ~main__index2~0 % 4294967296 % 4294967296 <= 2147483647 then ~main__index2~0 % 4294967296 % 4294967296 else ~main__index2~0 % 4294967296 % 4294967296 - 4294967296), 4);~__tmp_3~0 := (if #t~mem5 % 4294967296 == #t~mem6 % 4294967296 then 1 else 0);havoc #t~mem6;havoc #t~mem5;havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1261#false} is VALID [2018-11-23 13:09:20,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {1261#false} assume 0 == ~__VERIFIER_assert__cond~2; {1261#false} is VALID [2018-11-23 13:09:20,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2018-11-23 13:09:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:20,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:20,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-23 13:09:20,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 13:09:20,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:20,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:09:23,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:23,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:09:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:09:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2018-11-23 13:09:23,308 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-11-23 13:09:33,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:33,584 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 13:09:33,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:09:33,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 13:09:33,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:09:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-11-23 13:09:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:09:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-11-23 13:09:33,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2018-11-23 13:09:38,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 31 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:38,913 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:09:38,913 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:09:38,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2018-11-23 13:09:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:09:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:09:38,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:38,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:38,915 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:38,915 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:38,916 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:38,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:38,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:38,916 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:38,917 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:38,917 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:38,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:38,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:38,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:38,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:09:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:09:38,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-11-23 13:09:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:38,918 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:09:38,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:09:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:38,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:38,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:09:44,567 WARN L180 SmtUtils]: Spent 5.51 s on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2018-11-23 13:09:51,062 WARN L180 SmtUtils]: Spent 6.48 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-11-23 13:09:51,315 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2018-11-23 13:09:51,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:09:51,322 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:09:51,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:51,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:51,323 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:09:51,323 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:09:51,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:09:51,323 INFO L451 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2018-11-23 13:09:51,323 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2018-11-23 13:09:51,323 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2018-11-23 13:09:51,324 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-11-23 13:09:51,324 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2018-11-23 13:09:51,324 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-23 13:09:51,324 INFO L444 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse10 (div main_~main__index1~0 4294967296)) (.cse9 (div main_~main__index2~0 4294967296))) (let ((.cse0 (= |main_~#main__array~0.offset| 0)) (.cse2 (* 4294967296 .cse9)) (.cse3 (+ (* 4294967296 .cse10) main_~main__index2~0)) (.cse1 (= main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse1 (<= (+ main_~main__index1~0 .cse2 1) .cse3)) (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998)) .cse0 (or (let ((.cse8 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse8 (+ (* (- 17179869184) .cse10) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse7 (select .cse8 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse9))))) (let ((.cse6 (* 4294967296 (div .cse7 4294967296))) (.cse4 (+ (* 4294967296 (div .cse5 4294967296)) .cse7))) (and (<= .cse4 (+ .cse5 .cse6)) (<= (+ .cse6 .cse5) .cse4))))) (<= (+ main_~main__index1~0 .cse2) .cse3)) .cse1)))) [2018-11-23 13:09:51,325 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2018-11-23 13:09:51,325 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-11-23 13:09:51,325 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2018-11-23 13:09:51,325 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-11-23 13:09:51,325 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-11-23 13:09:51,325 INFO L444 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998)) (= |main_~#main__array~0.offset| 0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) [2018-11-23 13:09:51,326 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2018-11-23 13:09:51,326 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2018-11-23 13:09:51,326 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2018-11-23 13:09:51,326 INFO L444 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (let ((.cse0 (= |main_~#main__array~0.offset| 0)) (.cse1 (<= main_~main__index2~0 (+ .cse3 99999))) (.cse2 (= main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 .cse1 .cse2 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= 0 main_~__VERIFIER_assert__cond~1))) (and .cse0 (= main_~main____CPAchecker_TMP_0~0 1) .cse1 .cse2))) (<= (+ main_~main__index1~0 .cse3 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-11-23 13:09:51,326 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2018-11-23 13:09:51,326 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-23 13:09:51,327 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-11-23 13:09:51,327 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2018-11-23 13:09:51,327 INFO L444 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-11-23 13:09:51,327 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2018-11-23 13:09:51,327 INFO L444 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= |main_~#main__array~0.offset| 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-11-23 13:09:51,327 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2018-11-23 13:09:51,327 INFO L448 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-11-23 13:09:51,327 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-23 13:09:51,327 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2018-11-23 13:09:51,327 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2018-11-23 13:09:51,327 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-11-23 13:09:51,327 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-11-23 13:09:51,328 INFO L444 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-11-23 13:09:51,328 INFO L444 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998)) (= |main_~#main__array~0.offset| 0) (not (= 0 main_~__VERIFIER_assert__cond~2)) (= main_~__VERIFIER_assert__cond~0 1)) [2018-11-23 13:09:51,328 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-23 13:09:51,328 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-11-23 13:09:51,329 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:09:51,330 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 13:09:51,331 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2018-11-23 13:09:51,332 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2018-11-23 13:09:53,435 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 13:09:53,435 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 13:09:53,435 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 13:09:53,435 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2018-11-23 13:09:53,435 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 13:09:53,435 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 13:09:53,435 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2018-11-23 13:09:53,435 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-11-23 13:09:53,436 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-11-23 13:09:53,437 INFO L163 areAnnotationChecker]: CFG has 6 edges. 5 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:09:53,452 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,453 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,453 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,454 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,454 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,454 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,454 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,454 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,457 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,457 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,458 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,458 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,458 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,458 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,458 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,459 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:09:53 BoogieIcfgContainer [2018-11-23 13:09:53,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:09:53,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:09:53,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:09:53,465 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:09:53,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:04" (3/4) ... [2018-11-23 13:09:53,469 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:09:53,477 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:09:53,477 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:09:53,483 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-23 13:09:53,484 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 13:09:53,484 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:09:53,579 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c-witness.graphml [2018-11-23 13:09:53,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:09:53,580 INFO L168 Benchmark]: Toolchain (without parser) took 51159.47 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 853.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -662.1 MB). Peak memory consumption was 190.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:53,584 INFO L168 Benchmark]: CDTParser took 0.21 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:53,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.50 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:53,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.34 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:53,584 INFO L168 Benchmark]: Boogie Preprocessor took 52.39 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:53,585 INFO L168 Benchmark]: RCFGBuilder took 1148.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -740.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:53,585 INFO L168 Benchmark]: TraceAbstraction took 49370.58 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 132.6 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 52.5 MB). Peak memory consumption was 185.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:53,585 INFO L168 Benchmark]: Witness Printer took 114.43 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:53,587 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.21 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 434.50 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 33.34 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 52.39 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 1148.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -740.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49370.58 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 132.6 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 52.5 MB). Peak memory consumption was 185.2 MB. Max. memory is 7.1 GB. * Witness Printer took 114.43 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. 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 - 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: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + (-main__index2 + 4294967294)) / 4294967296) + (main__index1 + -1)) / 4294967296) + 99998 && main__array == 0) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2018-11-23 13:09:53,595 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,596 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,596 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,596 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,596 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,597 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,597 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,597 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,599 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,599 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,599 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,599 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,600 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,600 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,600 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:09:53,600 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((main__array == 0 && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || (((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + (-main__index2 + 4294967294)) / 4294967296) + (main__index1 + -1)) / 4294967296) + 99998 && main__array == 0) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) + unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] <= 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)]) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + (-main__index2 + 4294967294)) / 4294967296) + (main__index1 + -1)) / 4294967296) + 99998 && main__array == 0) && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__array == 0 && main____CPAchecker_TMP_0 == 1) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((main__array == 0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(0 == __VERIFIER_assert__cond)) || (((main__array == 0 && main____CPAchecker_TMP_0 == 1) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. SAFE Result, 47.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 12.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 204 SDslu, 272 SDs, 0 SdLazy, 159 SolverSat, 24 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, 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.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 49 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 20 NumberOfFragments, 393 HoareAnnotationTreeSize, 12 FomulaSimplifications, 856 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 12.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 27846 SizeOfPredicates, 2 NumberOfNonLiveVariables, 116 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...