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/array-tiling/poly1_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:20:06,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:20:06,538 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:20:06,556 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:20:06,556 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:20:06,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:20:06,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:20:06,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:20:06,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:20:06,567 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:20:06,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:20:06,570 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:20:06,571 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:20:06,573 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:20:06,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:20:06,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:20:06,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:20:06,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:20:06,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:20:06,587 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:20:06,588 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:20:06,589 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:20:06,591 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:20:06,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:20:06,592 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:20:06,593 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:20:06,594 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:20:06,594 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:20:06,595 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:20:06,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:20:06,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:20:06,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:20:06,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:20:06,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:20:06,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:20:06,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:20:06,600 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 12:20:06,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:20:06,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:20:06,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:20:06,620 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:20:06,621 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:20:06,621 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:20:06,621 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:20:06,622 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:20:06,622 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:20:06,622 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:20:06,622 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:20:06,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:20:06,623 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:20:06,623 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:20:06,623 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:20:06,623 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:20:06,623 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:20:06,624 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:20:06,624 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:20:06,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:20:06,624 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:20:06,625 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:20:06,625 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:20:06,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:20:06,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:20:06,625 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:20:06,626 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:20:06,626 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:20:06,626 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:20:06,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:20:06,626 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:20:06,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:20:06,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:20:06,712 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:20:06,714 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:20:06,715 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:20:06,716 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/poly1_true-unreach-call.i [2018-11-23 12:20:06,780 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7286ecc8a/62e0bda38c4a4588b4507c37d9aca046/FLAG9a34f1707 [2018-11-23 12:20:07,227 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:20:07,227 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/poly1_true-unreach-call.i [2018-11-23 12:20:07,233 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7286ecc8a/62e0bda38c4a4588b4507c37d9aca046/FLAG9a34f1707 [2018-11-23 12:20:07,617 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7286ecc8a/62e0bda38c4a4588b4507c37d9aca046 [2018-11-23 12:20:07,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:20:07,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:20:07,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:20:07,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:20:07,641 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:20:07,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:20:07" (1/1) ... [2018-11-23 12:20:07,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5963a746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:07, skipping insertion in model container [2018-11-23 12:20:07,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:20:07" (1/1) ... [2018-11-23 12:20:07,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:20:07,676 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:20:07,943 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:20:07,948 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:20:07,976 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:20:08,007 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:20:08,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08 WrapperNode [2018-11-23 12:20:08,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:20:08,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:20:08,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:20:08,009 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:20:08,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (1/1) ... [2018-11-23 12:20:08,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (1/1) ... [2018-11-23 12:20:08,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:20:08,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:20:08,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:20:08,041 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:20:08,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (1/1) ... [2018-11-23 12:20:08,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (1/1) ... [2018-11-23 12:20:08,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (1/1) ... [2018-11-23 12:20:08,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (1/1) ... [2018-11-23 12:20:08,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (1/1) ... [2018-11-23 12:20:08,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (1/1) ... [2018-11-23 12:20:08,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (1/1) ... [2018-11-23 12:20:08,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:20:08,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:20:08,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:20:08,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:20:08,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (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 12:20:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:20:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:20:08,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:20:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:20:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:20:08,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:20:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:20:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:20:08,234 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:20:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:20:08,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:20:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:20:08,739 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:20:08,739 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:20:08,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:20:08 BoogieIcfgContainer [2018-11-23 12:20:08,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:20:08,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:20:08,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:20:08,745 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:20:08,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:20:07" (1/3) ... [2018-11-23 12:20:08,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52de25a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:20:08, skipping insertion in model container [2018-11-23 12:20:08,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:20:08" (2/3) ... [2018-11-23 12:20:08,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52de25a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:20:08, skipping insertion in model container [2018-11-23 12:20:08,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:20:08" (3/3) ... [2018-11-23 12:20:08,749 INFO L112 eAbstractionObserver]: Analyzing ICFG poly1_true-unreach-call.i [2018-11-23 12:20:08,759 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:20:08,767 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:20:08,786 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:20:08,821 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:20:08,821 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:20:08,822 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:20:08,822 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:20:08,822 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:20:08,822 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:20:08,823 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:20:08,823 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:20:08,823 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:20:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 12:20:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:20:08,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:08,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:08,852 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:08,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:08,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1279113652, now seen corresponding path program 1 times [2018-11-23 12:20:08,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:08,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:08,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:08,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:08,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:09,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 12:20:09,037 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {29#true} is VALID [2018-11-23 12:20:09,038 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 12:20:09,038 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #56#return; {29#true} is VALID [2018-11-23 12:20:09,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2018-11-23 12:20:09,039 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {29#true} is VALID [2018-11-23 12:20:09,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {29#true} is VALID [2018-11-23 12:20:09,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 12:20:09,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} ~i~0 := 0; {30#false} is VALID [2018-11-23 12:20:09,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {30#false} is VALID [2018-11-23 12:20:09,048 INFO L256 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {30#false} is VALID [2018-11-23 12:20:09,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 12:20:09,049 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2018-11-23 12:20:09,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 12:20:09,052 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 12:20:09,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:20:09,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:20:09,061 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 12:20:09,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:09,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:20:09,178 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 12:20:09,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:20:09,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:20:09,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:20:09,192 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 12:20:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:09,366 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 12:20:09,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:20:09,366 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 12:20:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:20:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 12:20:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:20:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 12:20:09,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-23 12:20:09,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:09,738 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:20:09,738 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:20:09,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:20:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:20:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:20:09,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:09,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:20:09,786 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:20:09,787 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:20:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:09,790 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:20:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:20:09,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:09,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:09,791 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:20:09,791 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:20:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:09,795 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:20:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:20:09,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:09,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:09,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:09,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:20:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:20:09,801 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-23 12:20:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:09,801 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:20:09,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:20:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:20:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:20:09,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:09,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:09,803 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:09,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:09,803 INFO L82 PathProgramCache]: Analyzing trace with hash 249058862, now seen corresponding path program 1 times [2018-11-23 12:20:09,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:09,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:09,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:09,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:09,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:09,834 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:20:09,835 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:20:09,835 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:20:09,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:09,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:10,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2018-11-23 12:20:10,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {155#true} is VALID [2018-11-23 12:20:10,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {155#true} assume true; {155#true} is VALID [2018-11-23 12:20:10,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {155#true} {155#true} #56#return; {155#true} is VALID [2018-11-23 12:20:10,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {155#true} call #t~ret5 := main(); {155#true} is VALID [2018-11-23 12:20:10,095 INFO L273 TraceCheckUtils]: 5: Hoare triple {155#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {155#true} is VALID [2018-11-23 12:20:10,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {155#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {178#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:20:10,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {178#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} assume !(~i~0 < ~SIZE~0); {156#false} is VALID [2018-11-23 12:20:10,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {156#false} ~i~0 := 0; {156#false} is VALID [2018-11-23 12:20:10,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {156#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {156#false} is VALID [2018-11-23 12:20:10,113 INFO L256 TraceCheckUtils]: 10: Hoare triple {156#false} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {156#false} is VALID [2018-11-23 12:20:10,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {156#false} ~cond := #in~cond; {156#false} is VALID [2018-11-23 12:20:10,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {156#false} assume 0 == ~cond; {156#false} is VALID [2018-11-23 12:20:10,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {156#false} assume !false; {156#false} is VALID [2018-11-23 12:20:10,115 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 12:20:10,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:20:10,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:20:10,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 12:20:10,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:10,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:20:10,172 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 12:20:10,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:20:10,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:20:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:20:10,173 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-23 12:20:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:10,421 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:20:10,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:20:10,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 12:20:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:20:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2018-11-23 12:20:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:20:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2018-11-23 12:20:10,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2018-11-23 12:20:10,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:10,734 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:20:10,734 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:20:10,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 12:20:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:20:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 12:20:10,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:10,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 12:20:10,811 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 12:20:10,811 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 12:20:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:10,814 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:20:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:20:10,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:10,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:10,815 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 12:20:10,816 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 12:20:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:10,818 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:20:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:20:10,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:10,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:10,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:10,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:20:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:20:10,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-11-23 12:20:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:10,821 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:20:10,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:20:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:20:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:20:10,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:10,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:10,823 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:10,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:10,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1260861268, now seen corresponding path program 1 times [2018-11-23 12:20:10,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:10,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:10,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:10,834 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:20:10,835 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:20:10,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:20:10,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:10,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:11,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-23 12:20:11,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {318#true} is VALID [2018-11-23 12:20:11,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2018-11-23 12:20:11,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #56#return; {318#true} is VALID [2018-11-23 12:20:11,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret5 := main(); {318#true} is VALID [2018-11-23 12:20:11,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {318#true} is VALID [2018-11-23 12:20:11,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {318#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {341#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:20:11,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {341#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {341#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:20:11,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {341#(and (< 1 ~SIZE~0) (<= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {348#(and (< 1 ~SIZE~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:20:11,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {348#(and (< 1 ~SIZE~0) (<= main_~i~0 1))} assume !(~i~0 < ~SIZE~0); {319#false} is VALID [2018-11-23 12:20:11,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {319#false} ~i~0 := 0; {319#false} is VALID [2018-11-23 12:20:11,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {319#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {319#false} is VALID [2018-11-23 12:20:11,407 INFO L256 TraceCheckUtils]: 12: Hoare triple {319#false} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {319#false} is VALID [2018-11-23 12:20:11,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {319#false} ~cond := #in~cond; {319#false} is VALID [2018-11-23 12:20:11,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {319#false} assume 0 == ~cond; {319#false} is VALID [2018-11-23 12:20:11,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-23 12:20:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:11,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:20:11,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:20:11,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:20:11,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:11,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:20:11,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:11,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:20:11,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:20:11,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:20:11,479 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 4 states. [2018-11-23 12:20:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:11,732 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 12:20:11,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:20:11,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:20:11,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:20:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2018-11-23 12:20:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:20:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2018-11-23 12:20:11,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2018-11-23 12:20:11,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:11,820 INFO L225 Difference]: With dead ends: 35 [2018-11-23 12:20:11,820 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:20:11,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:20:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:20:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 12:20:11,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:11,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 12:20:11,859 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 12:20:11,859 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 12:20:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:11,862 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:20:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:20:11,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:11,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:11,863 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 12:20:11,863 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 12:20:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:11,865 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:20:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:20:11,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:11,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:11,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:11,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:20:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 12:20:11,868 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2018-11-23 12:20:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:11,869 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 12:20:11,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:20:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:20:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:20:11,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:11,870 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:11,870 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:11,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:11,871 INFO L82 PathProgramCache]: Analyzing trace with hash -595160150, now seen corresponding path program 2 times [2018-11-23 12:20:11,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:11,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:11,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:20:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:11,881 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:20:11,882 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:20:11,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:20:11,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:20:11,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:20:11,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:20:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:11,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:12,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-23 12:20:12,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:20:12,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:19 [2018-11-23 12:20:12,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 12:20:12,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:12,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:12,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-11-23 12:20:12,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-23 12:20:12,818 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:20:12,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 12:20:12,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:12,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:12,866 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:20:12,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:12,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-11-23 12:20:12,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:12,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:79, output treesize:7 [2018-11-23 12:20:12,902 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:12,902 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|, v_prenex_3, v_prenex_2, v_prenex_4]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse2 (<= .cse5 2147483647)) (.cse1 (* 8 .cse5)) (.cse3 (= main_~i~0 0))) (or (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= 1 (select .cse0 (+ |main_~#a~0.offset| 8))) (= (select .cse0 (+ .cse1 |main_~#a~0.offset|)) |main_#t~mem4|) (= 0 (select .cse0 |main_~#a~0.offset|)) .cse2 .cse3)) (let ((.cse4 (select v_prenex_3 v_prenex_2))) (and (= 0 (select .cse4 v_prenex_4)) (not .cse2) (= (select .cse4 (+ .cse1 v_prenex_4 (- 34359738368))) |main_#t~mem4|) (= 1 (select .cse4 (+ v_prenex_4 8))) .cse3))))) [2018-11-23 12:20:12,903 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem4|) (= main_~i~0 0)) [2018-11-23 12:20:12,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {498#true} call ULTIMATE.init(); {498#true} is VALID [2018-11-23 12:20:12,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {498#true} is VALID [2018-11-23 12:20:12,959 INFO L273 TraceCheckUtils]: 2: Hoare triple {498#true} assume true; {498#true} is VALID [2018-11-23 12:20:12,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {498#true} {498#true} #56#return; {498#true} is VALID [2018-11-23 12:20:12,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {498#true} call #t~ret5 := main(); {498#true} is VALID [2018-11-23 12:20:12,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {498#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {498#true} is VALID [2018-11-23 12:20:12,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {498#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {521#(= main_~i~0 0)} is VALID [2018-11-23 12:20:12,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {521#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {525#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:12,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {525#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {529#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:12,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {529#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {533#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:12,977 INFO L273 TraceCheckUtils]: 10: Hoare triple {533#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {533#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:12,978 INFO L273 TraceCheckUtils]: 11: Hoare triple {533#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !(~i~0 < ~SIZE~0); {533#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:12,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {533#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0; {543#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:12,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {543#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {547#(and (= 0 |main_#t~mem4|) (= main_~i~0 0))} is VALID [2018-11-23 12:20:12,981 INFO L256 TraceCheckUtils]: 14: Hoare triple {547#(and (= 0 |main_#t~mem4|) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {551#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:12,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {551#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {555#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:12,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {555#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {499#false} is VALID [2018-11-23 12:20:12,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {499#false} assume !false; {499#false} is VALID [2018-11-23 12:20:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:13,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:20:13,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:20:13,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-23 12:20:13,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:13,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:20:13,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:13,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:20:13,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:20:13,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:20:13,043 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 10 states. [2018-11-23 12:20:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:14,008 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-23 12:20:14,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:20:14,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-23 12:20:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:20:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2018-11-23 12:20:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:20:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2018-11-23 12:20:14,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 53 transitions. [2018-11-23 12:20:14,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:14,159 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:20:14,160 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:20:14,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:20:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:20:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-11-23 12:20:14,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:14,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 32 states. [2018-11-23 12:20:14,208 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 32 states. [2018-11-23 12:20:14,209 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 32 states. [2018-11-23 12:20:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:14,213 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 12:20:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:20:14,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:14,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:14,215 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 46 states. [2018-11-23 12:20:14,215 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 46 states. [2018-11-23 12:20:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:14,219 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 12:20:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:20:14,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:14,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:14,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:14,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:20:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 12:20:14,223 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2018-11-23 12:20:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:14,224 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 12:20:14,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:20:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 12:20:14,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:20:14,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:14,225 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:14,225 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:14,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:14,226 INFO L82 PathProgramCache]: Analyzing trace with hash -806512856, now seen corresponding path program 3 times [2018-11-23 12:20:14,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:14,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:14,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:20:14,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:14,240 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:20:14,240 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:20:14,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:20:14,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:20:14,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:20:14,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:20:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:14,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:14,336 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:20:14,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-23 12:20:14,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:20:14,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,447 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,519 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:19 [2018-11-23 12:20:14,727 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:20:14,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:20:14,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 43 [2018-11-23 12:20:14,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:14,862 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:73, output treesize:26 [2018-11-23 12:20:14,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-23 12:20:14,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:14,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-11-23 12:20:15,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:15,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:15,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:15,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-23 12:20:15,175 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:20:15,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:15,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-23 12:20:15,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,214 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:20:15,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:15,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2018-11-23 12:20:15,226 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:15,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:15,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:15,252 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:97, output treesize:7 [2018-11-23 12:20:15,257 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:15,258 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|, v_prenex_8, v_prenex_7, v_prenex_9]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse2 (<= .cse5 2147483647)) (.cse1 (* 8 .cse5)) (.cse3 (= main_~i~0 0))) (or (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= 1 (select .cse0 (+ |main_~#a~0.offset| 8))) (= (select .cse0 (+ .cse1 |main_~#a~0.offset|)) |main_#t~mem4|) (= 4 (select .cse0 (+ |main_~#a~0.offset| 16))) (= 0 (select .cse0 |main_~#a~0.offset|)) .cse2 .cse3)) (let ((.cse4 (select v_prenex_8 v_prenex_7))) (and (not .cse2) (= 0 (select .cse4 v_prenex_9)) (= 4 (select .cse4 (+ v_prenex_9 16))) (= (select .cse4 (+ .cse1 v_prenex_9 (- 34359738368))) |main_#t~mem4|) (= 1 (select .cse4 (+ v_prenex_9 8))) .cse3))))) [2018-11-23 12:20:15,258 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem4|) (= main_~i~0 0)) [2018-11-23 12:20:15,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {773#true} call ULTIMATE.init(); {773#true} is VALID [2018-11-23 12:20:15,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {773#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {773#true} is VALID [2018-11-23 12:20:15,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {773#true} assume true; {773#true} is VALID [2018-11-23 12:20:15,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {773#true} {773#true} #56#return; {773#true} is VALID [2018-11-23 12:20:15,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {773#true} call #t~ret5 := main(); {773#true} is VALID [2018-11-23 12:20:15,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {773#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {773#true} is VALID [2018-11-23 12:20:15,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {773#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {796#(= main_~i~0 0)} is VALID [2018-11-23 12:20:15,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {796#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {800#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:15,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {800#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {804#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:15,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {804#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {808#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:15,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {808#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {812#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:15,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {812#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {816#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:15,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {816#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {816#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:15,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {816#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !(~i~0 < ~SIZE~0); {816#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:15,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {816#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0; {826#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:15,343 INFO L273 TraceCheckUtils]: 15: Hoare triple {826#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {830#(and (= 0 |main_#t~mem4|) (= main_~i~0 0))} is VALID [2018-11-23 12:20:15,344 INFO L256 TraceCheckUtils]: 16: Hoare triple {830#(and (= 0 |main_#t~mem4|) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {834#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:15,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {834#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {838#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:15,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {838#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {774#false} is VALID [2018-11-23 12:20:15,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {774#false} assume !false; {774#false} is VALID [2018-11-23 12:20:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:15,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:20:15,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 12:20:15,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 12:20:15,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:15,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:20:15,438 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 12:20:15,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:20:15,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:20:15,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:20:15,440 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 12 states. [2018-11-23 12:20:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:17,364 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-23 12:20:17,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:20:17,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 12:20:17,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:20:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2018-11-23 12:20:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:20:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2018-11-23 12:20:17,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 72 transitions. [2018-11-23 12:20:17,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:17,555 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:20:17,555 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:20:17,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:20:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:20:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 34. [2018-11-23 12:20:17,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:17,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 34 states. [2018-11-23 12:20:17,605 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 34 states. [2018-11-23 12:20:17,606 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 34 states. [2018-11-23 12:20:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:17,611 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 12:20:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 12:20:17,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:17,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:17,613 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 65 states. [2018-11-23 12:20:17,613 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 65 states. [2018-11-23 12:20:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:17,617 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 12:20:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 12:20:17,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:17,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:17,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:17,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:20:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 12:20:17,622 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 20 [2018-11-23 12:20:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:17,622 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 12:20:17,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:20:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 12:20:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:20:17,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:17,623 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:17,624 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:17,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2053000410, now seen corresponding path program 4 times [2018-11-23 12:20:17,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:17,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:17,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:20:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:17,633 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:20:17,633 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:20:17,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:20:17,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:20:17,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:20:17,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:20:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:17,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:20:17,863 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:20:17,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-23 12:20:18,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:20:18,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,123 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:19 [2018-11-23 12:20:18,300 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:20:18,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:20:18,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 43 [2018-11-23 12:20:18,326 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,343 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:73, output treesize:26 [2018-11-23 12:20:18,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-11-23 12:20:18,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 96 [2018-11-23 12:20:18,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:35 [2018-11-23 12:20:18,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-11-23 12:20:18,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:18,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-11-23 12:20:18,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:18,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:19,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:19,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-23 12:20:19,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-11-23 12:20:19,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,171 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:20:19,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:20:19,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 67 [2018-11-23 12:20:19,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:20:19,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:19,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:20:19,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:115, output treesize:7 [2018-11-23 12:20:19,221 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:20:19,221 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|, v_prenex_14, v_prenex_13, v_prenex_15]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse2 (* 8 .cse5)) (.cse0 (<= .cse5 2147483647)) (.cse3 (= main_~i~0 0))) (or (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (and (not .cse0) (= 9 (select .cse1 (+ |main_~#a~0.offset| 24))) (= 1 (select .cse1 (+ |main_~#a~0.offset| 8))) (= (select .cse1 (+ .cse2 |main_~#a~0.offset| (- 34359738368))) |main_#t~mem4|) (= 4 (select .cse1 (+ |main_~#a~0.offset| 16))) (= 0 (select .cse1 |main_~#a~0.offset|)) .cse3)) (let ((.cse4 (select v_prenex_14 v_prenex_13))) (and (= 9 (select .cse4 (+ v_prenex_15 24))) (= 4 (select .cse4 (+ v_prenex_15 16))) (= (select .cse4 (+ .cse2 v_prenex_15)) |main_#t~mem4|) (= 1 (select .cse4 (+ v_prenex_15 8))) .cse0 .cse3 (= 0 (select .cse4 v_prenex_15))))))) [2018-11-23 12:20:19,221 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem4|) (= main_~i~0 0)) [2018-11-23 12:20:19,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2018-11-23 12:20:19,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1128#true} is VALID [2018-11-23 12:20:19,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2018-11-23 12:20:19,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #56#return; {1128#true} is VALID [2018-11-23 12:20:19,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret5 := main(); {1128#true} is VALID [2018-11-23 12:20:19,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {1128#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1128#true} is VALID [2018-11-23 12:20:19,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {1128#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {1151#(= main_~i~0 0)} is VALID [2018-11-23 12:20:19,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {1151#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1155#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:19,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {1155#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1159#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:19,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {1159#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1163#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:19,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {1163#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1167#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:19,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {1167#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1171#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:19,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {1171#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1175#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:19,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {1175#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1179#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:19,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {1179#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1179#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:19,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {1179#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !(~i~0 < ~SIZE~0); {1179#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:20:19,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {1179#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0; {1189#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0))} is VALID [2018-11-23 12:20:19,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {1189#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1193#(and (= 0 |main_#t~mem4|) (= main_~i~0 0))} is VALID [2018-11-23 12:20:19,282 INFO L256 TraceCheckUtils]: 18: Hoare triple {1193#(and (= 0 |main_#t~mem4|) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {1197#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:20:19,283 INFO L273 TraceCheckUtils]: 19: Hoare triple {1197#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1201#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:20:19,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {1201#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1129#false} is VALID [2018-11-23 12:20:19,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2018-11-23 12:20:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:20:19,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:20:19,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-23 12:20:19,307 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-11-23 12:20:19,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:20:19,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:20:19,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:19,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:20:19,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:20:19,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:20:19,429 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 14 states. [2018-11-23 12:20:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:22,557 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-23 12:20:22,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:20:22,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-11-23 12:20:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:20:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 81 transitions. [2018-11-23 12:20:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:20:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 81 transitions. [2018-11-23 12:20:22,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 81 transitions. [2018-11-23 12:20:22,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:22,680 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:20:22,680 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:20:22,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:20:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:20:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 36. [2018-11-23 12:20:22,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:22,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 36 states. [2018-11-23 12:20:22,711 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 36 states. [2018-11-23 12:20:22,711 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 36 states. [2018-11-23 12:20:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:22,716 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-23 12:20:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-23 12:20:22,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:22,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:22,717 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 72 states. [2018-11-23 12:20:22,717 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 72 states. [2018-11-23 12:20:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:22,722 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-23 12:20:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-23 12:20:22,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:22,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:22,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:22,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:20:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 12:20:22,725 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2018-11-23 12:20:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:22,725 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 12:20:22,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:20:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:20:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:20:22,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:22,727 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:20:22,727 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:22,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:22,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1631664220, now seen corresponding path program 5 times [2018-11-23 12:20:22,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:22,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:22,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:20:22,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:22,735 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:20:22,736 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:20:22,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:20:22,760 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:21:09,659 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:21:09,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:21:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:09,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:09,756 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:21:09,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:09,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-23 12:21:09,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:21:09,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:09,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:09,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:09,967 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:22 [2018-11-23 12:21:10,196 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 12:21:10,244 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:21:10,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:21:10,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 43 [2018-11-23 12:21:10,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,300 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:79, output treesize:29 [2018-11-23 12:21:10,439 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:21:10,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 12:21:10,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 96 [2018-11-23 12:21:10,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,500 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,515 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:97, output treesize:38 [2018-11-23 12:21:10,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-11-23 12:21:10,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 173 [2018-11-23 12:21:10,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:10,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:47 [2018-11-23 12:21:10,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-23 12:21:10,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,967 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:10,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-11-23 12:21:10,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:11,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:11,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:11,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-11-23 12:21:11,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-11-23 12:21:11,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,403 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:21:11,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:11,414 INFO L303 Elim1Store]: Index analysis took 105 ms [2018-11-23 12:21:11,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 71 [2018-11-23 12:21:11,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:11,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:11,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:11,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:114, output treesize:11 [2018-11-23 12:21:11,464 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:11,465 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_21, v_prenex_20, |#memory_int|, |main_~#a~0.base|]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse2 (<= .cse5 2147483647)) (.cse1 (* 8 .cse5)) (.cse3 (= main_~i~0 0))) (or (let ((.cse0 (select v_prenex_21 v_prenex_20))) (and (= 9 (select .cse0 24)) (= |main_#t~mem4| (select .cse0 .cse1)) (= 4 (select .cse0 16)) (= (select .cse0 0) 0) (= 1 (select .cse0 8)) (= 16 (select .cse0 32)) .cse2 .cse3)) (let ((.cse4 (select |#memory_int| |main_~#a~0.base|))) (and (not .cse2) (= |main_#t~mem4| (select .cse4 (+ .cse1 (- 34359738368)))) (= 4 (select .cse4 16)) (= 9 (select .cse4 24)) (= 16 (select .cse4 32)) (= 1 (select .cse4 8)) (= (select .cse4 0) 0) .cse3))))) [2018-11-23 12:21:11,465 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0)) [2018-11-23 12:21:11,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {1520#true} call ULTIMATE.init(); {1520#true} is VALID [2018-11-23 12:21:11,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {1520#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1520#true} is VALID [2018-11-23 12:21:11,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {1520#true} assume true; {1520#true} is VALID [2018-11-23 12:21:11,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1520#true} {1520#true} #56#return; {1520#true} is VALID [2018-11-23 12:21:11,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {1520#true} call #t~ret5 := main(); {1520#true} is VALID [2018-11-23 12:21:11,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {1520#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1520#true} is VALID [2018-11-23 12:21:11,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {1520#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {1543#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {1543#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1547#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {1547#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1551#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {1551#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1555#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {1555#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1559#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {1559#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1563#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {1563#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1567#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {1567#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1571#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {1571#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1575#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {1575#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1579#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {1579#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1579#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {1579#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {1579#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {1579#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1589#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:11,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {1589#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1593#(and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:11,559 INFO L256 TraceCheckUtils]: 20: Hoare triple {1593#(and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {1597#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:21:11,561 INFO L273 TraceCheckUtils]: 21: Hoare triple {1597#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1601#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:21:11,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {1601#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1521#false} is VALID [2018-11-23 12:21:11,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {1521#false} assume !false; {1521#false} is VALID [2018-11-23 12:21:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:11,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:21:11,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-23 12:21:11,595 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-11-23 12:21:11,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:11,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:21:11,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:11,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:21:11,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:21:11,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:21:11,638 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 16 states. [2018-11-23 12:21:12,435 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 12:21:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:15,259 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-11-23 12:21:15,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:21:15,264 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-11-23 12:21:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:21:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 85 transitions. [2018-11-23 12:21:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:21:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 85 transitions. [2018-11-23 12:21:15,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 85 transitions. [2018-11-23 12:21:15,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:15,500 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:21:15,500 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 12:21:15,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:21:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 12:21:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2018-11-23 12:21:15,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:15,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 38 states. [2018-11-23 12:21:15,591 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 38 states. [2018-11-23 12:21:15,591 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 38 states. [2018-11-23 12:21:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:15,595 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-11-23 12:21:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-11-23 12:21:15,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:15,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:15,596 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 75 states. [2018-11-23 12:21:15,596 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 75 states. [2018-11-23 12:21:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:15,600 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-11-23 12:21:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-11-23 12:21:15,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:15,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:15,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:15,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:21:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 12:21:15,602 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2018-11-23 12:21:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:15,603 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 12:21:15,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:21:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 12:21:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:21:15,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:15,604 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:15,604 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:15,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1815111203, now seen corresponding path program 1 times [2018-11-23 12:21:15,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:15,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:15,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:15,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:21:15,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:15,612 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:21:15,612 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:21:15,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:21:15,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:15,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:16,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 12:21:16,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 12:21:16,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:16,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:16,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:16,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 12:21:16,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-23 12:21:16,758 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:21:16,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 12:21:16,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:16,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:16,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:16,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:65, output treesize:7 [2018-11-23 12:21:16,784 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:16,784 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_23, v_prenex_22, v_prenex_24, |#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse3 (<= .cse5 2147483647)) (.cse2 (= main_~i~0 1)) (.cse1 (* 8 .cse5))) (or (let ((.cse0 (select v_prenex_23 v_prenex_22))) (and (= (select .cse0 (+ .cse1 v_prenex_24)) |main_#t~mem4|) (= 1 (select .cse0 (+ v_prenex_24 8))) .cse2 .cse3)) (let ((.cse4 (select |#memory_int| |main_~#a~0.base|))) (and (not .cse3) (= 1 (select .cse4 (+ |main_~#a~0.offset| 8))) .cse2 (= (select .cse4 (+ .cse1 |main_~#a~0.offset| (- 34359738368))) |main_#t~mem4|)))))) [2018-11-23 12:21:16,784 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (= 1 |main_#t~mem4|)) [2018-11-23 12:21:16,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {1935#true} call ULTIMATE.init(); {1935#true} is VALID [2018-11-23 12:21:16,822 INFO L273 TraceCheckUtils]: 1: Hoare triple {1935#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1935#true} is VALID [2018-11-23 12:21:16,822 INFO L273 TraceCheckUtils]: 2: Hoare triple {1935#true} assume true; {1935#true} is VALID [2018-11-23 12:21:16,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1935#true} {1935#true} #56#return; {1935#true} is VALID [2018-11-23 12:21:16,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {1935#true} call #t~ret5 := main(); {1935#true} is VALID [2018-11-23 12:21:16,823 INFO L273 TraceCheckUtils]: 5: Hoare triple {1935#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1935#true} is VALID [2018-11-23 12:21:16,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {1935#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {1958#(= main_~i~0 0)} is VALID [2018-11-23 12:21:16,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {1958#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1958#(= main_~i~0 0)} is VALID [2018-11-23 12:21:16,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {1958#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1965#(= main_~i~0 1)} is VALID [2018-11-23 12:21:16,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {1965#(= main_~i~0 1)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1969#(= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))} is VALID [2018-11-23 12:21:16,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {1969#(= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1969#(= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))} is VALID [2018-11-23 12:21:16,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {1969#(= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))} assume !(~i~0 < ~SIZE~0); {1969#(= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))} is VALID [2018-11-23 12:21:16,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {1969#(= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)))} ~i~0 := 0; {1979#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:16,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {1979#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {1979#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:16,829 INFO L256 TraceCheckUtils]: 14: Hoare triple {1979#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {1986#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 8)) 1))} is VALID [2018-11-23 12:21:16,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {1986#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 8)) 1))} ~cond := #in~cond; {1990#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 8)) 1)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:21:16,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {1990#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 8)) 1)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {1994#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 8)) 1)))} is VALID [2018-11-23 12:21:16,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {1994#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 8)) 1)))} assume true; {1994#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 8)) 1)))} is VALID [2018-11-23 12:21:16,833 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1994#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 8)) 1)))} {1979#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0))} #60#return; {1979#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:16,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {1979#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0))} havoc #t~mem4; {1979#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:16,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {1979#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2007#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:16,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {2007#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2011#(and (= main_~i~0 1) (= 1 |main_#t~mem4|))} is VALID [2018-11-23 12:21:16,837 INFO L256 TraceCheckUtils]: 22: Hoare triple {2011#(and (= main_~i~0 1) (= 1 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {2015#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:21:16,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {2015#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2019#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:21:16,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {2019#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1936#false} is VALID [2018-11-23 12:21:16,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {1936#false} assume !false; {1936#false} is VALID [2018-11-23 12:21:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:16,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:21:16,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-23 12:21:16,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-11-23 12:21:16,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:16,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:21:16,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:16,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:21:16,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:21:16,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:21:16,891 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 13 states. [2018-11-23 12:21:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:18,069 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-23 12:21:18,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:21:18,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-11-23 12:21:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:21:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 63 transitions. [2018-11-23 12:21:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:21:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 63 transitions. [2018-11-23 12:21:18,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 63 transitions. [2018-11-23 12:21:18,214 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 12:21:18,216 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:21:18,216 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 12:21:18,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:21:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 12:21:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 47. [2018-11-23 12:21:18,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:18,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 47 states. [2018-11-23 12:21:18,284 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 47 states. [2018-11-23 12:21:18,285 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 47 states. [2018-11-23 12:21:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:18,289 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-23 12:21:18,289 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-11-23 12:21:18,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:18,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:18,290 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 73 states. [2018-11-23 12:21:18,290 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 73 states. [2018-11-23 12:21:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:18,293 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-23 12:21:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-11-23 12:21:18,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:18,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:18,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:18,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:21:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-23 12:21:18,296 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2018-11-23 12:21:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:18,296 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-23 12:21:18,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:21:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-23 12:21:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:21:18,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:18,297 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:18,297 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:18,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:18,298 INFO L82 PathProgramCache]: Analyzing trace with hash -454511454, now seen corresponding path program 6 times [2018-11-23 12:21:18,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:18,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:18,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:18,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:18,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:18,305 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:21:18,305 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:21:18,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:21:18,321 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:21:23,886 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:21:23,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:21:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:23,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:23,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-11-23 12:21:24,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:21:24,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:28 [2018-11-23 12:21:24,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-11-23 12:21:24,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:24,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:24,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 43 [2018-11-23 12:21:24,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:35 [2018-11-23 12:21:24,874 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:21:24,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 12:21:24,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:24,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:24,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:24,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:24,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:24,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:24,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 96 [2018-11-23 12:21:24,921 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:24,955 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:109, output treesize:44 [2018-11-23 12:21:25,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2018-11-23 12:21:25,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 173 [2018-11-23 12:21:25,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:25,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:25,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:25,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:53 [2018-11-23 12:21:25,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-23 12:21:25,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-11-23 12:21:25,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:25,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:25,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:25,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-11-23 12:21:25,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 69 [2018-11-23 12:21:25,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:25,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:27,661 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimCell_26 (+ |main_~#a~0.offset| 32)) (* main_~i~0 main_~i~0)) [2018-11-23 12:21:27,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:27,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:27,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:27,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:27,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:29,678 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (* main_~i~0 main_~i~0) (select v_arrayElimCell_26 (+ |main_~#a~0.offset| 24))) [2018-11-23 12:21:29,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:29,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:29,684 INFO L303 Elim1Store]: Index analysis took 4063 ms [2018-11-23 12:21:29,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 26 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 357 [2018-11-23 12:21:29,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:29,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:30,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 67 [2018-11-23 12:21:30,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,355 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimCell_27 (+ |main_~#a~0.offset| 8)) (* main_~i~0 main_~i~0)) [2018-11-23 12:21:30,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,450 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (* main_~i~0 main_~i~0) (select v_arrayElimCell_27 (+ |main_~#a~0.offset| 24))) [2018-11-23 12:21:30,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:30,500 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimCell_27 (+ |main_~#a~0.offset| 16)) (* main_~i~0 main_~i~0)) [2018-11-23 12:21:30,530 INFO L303 Elim1Store]: Index analysis took 444 ms [2018-11-23 12:21:30,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 208 [2018-11-23 12:21:30,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 32 xjuncts. [2018-11-23 12:21:37,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-23 12:21:38,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 12:21:38,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:163, output treesize:520 [2018-11-23 12:21:40,532 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:40,533 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_29, |v_#memory_int_26|]. (let ((.cse13 (mod main_~i~0 4294967296))) (let ((.cse5 (* 8 .cse13)) (.cse6 (* main_~i~0 main_~i~0)) (.cse9 (<= .cse13 2147483647)) (.cse7 (+ |main_~#a~0.offset| 32)) (.cse8 (+ |main_~#a~0.offset| 24)) (.cse0 (<= ~SIZE~0 2147483647)) (.cse3 (< main_~i~0 ~SIZE~0)) (.cse4 (< 1 ~SIZE~0)) (.cse10 (+ |main_~#a~0.offset| 16)) (.cse2 (+ |main_~#a~0.offset| 8)) (.cse11 (= |main_~#a~0.offset| 0))) (or (let ((.cse1 (select v_prenex_29 |main_~#a~0.base|))) (and .cse0 (= 1 (select .cse1 .cse2)) .cse3 .cse4 (= (select .cse1 |main_~#a~0.offset|) 0) (= |#memory_int| (store v_prenex_29 |main_~#a~0.base| (store .cse1 (+ .cse5 |main_~#a~0.offset|) .cse6))) (= (select .cse1 .cse7) 16) (= (select .cse1 .cse8) 9) .cse9 (= 4 (select .cse1 .cse10)) .cse11)) (let ((.cse12 (select |v_#memory_int_26| |main_~#a~0.base|))) (and (= (store |v_#memory_int_26| |main_~#a~0.base| (store .cse12 (+ .cse5 |main_~#a~0.offset| (- 34359738368)) .cse6)) |#memory_int|) (not .cse9) (= (select .cse12 .cse7) 16) (= (select .cse12 .cse8) 9) .cse0 .cse3 .cse4 (= 4 (select .cse12 .cse10)) (= (select .cse12 |main_~#a~0.offset|) 0) (= 1 (select .cse12 .cse2)) .cse11))))) [2018-11-23 12:21:40,533 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse20 (mod main_~i~0 4294967296))) (let ((.cse16 (* 8 .cse20)) (.cse15 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse11 (+ |main_~#a~0.offset| 32)) (.cse18 (select .cse15 |main_~#a~0.offset|)) (.cse12 (+ .cse16 |main_~#a~0.offset|)) (.cse17 (* main_~i~0 main_~i~0)) (.cse13 (+ |main_~#a~0.offset| 8)) (.cse14 (+ |main_~#a~0.offset| 24)) (.cse19 (+ |main_~#a~0.offset| 16))) (let ((.cse9 (<= .cse20 2147483647)) (.cse7 (= 4 (select .cse15 .cse19))) (.cse0 (= 9 (select .cse15 .cse14))) (.cse1 (= 1 (select .cse15 .cse13))) (.cse2 (<= ~SIZE~0 2147483647)) (.cse3 (< main_~i~0 ~SIZE~0)) (.cse4 (< 1 ~SIZE~0)) (.cse5 (= (select .cse15 .cse12) .cse17)) (.cse6 (= |main_~#a~0.offset| .cse18)) (.cse8 (= 16 (select .cse15 .cse11))) (.cse10 (= |main_~#a~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse11 .cse12) .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse12 .cse13) .cse8 .cse10) (and (= |main_~#a~0.offset| .cse12) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse14 .cse12) .cse8 .cse10) (and (not .cse9) .cse0 (= (select .cse15 (+ .cse16 |main_~#a~0.offset| (- 34359738368))) .cse17) .cse1 .cse2 .cse3 .cse4 .cse7 (= 0 .cse18) .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse12 .cse19) .cse8 .cse10)))))) [2018-11-23 12:21:41,286 WARN L180 SmtUtils]: Spent 698.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 12:21:41,779 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-23 12:21:42,115 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 28 [2018-11-23 12:21:42,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-11-23 12:21:42,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,303 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:21:42,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:42,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 71 [2018-11-23 12:21:42,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:42,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:42,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:42,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:114, output treesize:11 [2018-11-23 12:21:42,396 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:42,396 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_37, v_prenex_36, |#memory_int|, |main_~#a~0.base|]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse2 (<= .cse5 2147483647)) (.cse1 (* 8 .cse5)) (.cse3 (= main_~i~0 0))) (or (let ((.cse0 (select v_prenex_37 v_prenex_36))) (and (= 4 (select .cse0 16)) (= 16 (select .cse0 32)) (= 9 (select .cse0 24)) (= |main_#t~mem4| (select .cse0 .cse1)) (= (select .cse0 0) 0) (= 1 (select .cse0 8)) .cse2 .cse3)) (let ((.cse4 (select |#memory_int| |main_~#a~0.base|))) (and (not .cse2) (= |main_#t~mem4| (select .cse4 (+ .cse1 (- 34359738368)))) (= 4 (select .cse4 16)) (= 9 (select .cse4 24)) (= 16 (select .cse4 32)) (= 1 (select .cse4 8)) (= (select .cse4 0) 0) .cse3))))) [2018-11-23 12:21:42,397 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0)) [2018-11-23 12:21:42,643 INFO L256 TraceCheckUtils]: 0: Hoare triple {2351#true} call ULTIMATE.init(); {2351#true} is VALID [2018-11-23 12:21:42,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {2351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2351#true} is VALID [2018-11-23 12:21:42,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {2351#true} assume true; {2351#true} is VALID [2018-11-23 12:21:42,644 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2351#true} {2351#true} #56#return; {2351#true} is VALID [2018-11-23 12:21:42,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {2351#true} call #t~ret5 := main(); {2351#true} is VALID [2018-11-23 12:21:42,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {2351#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2371#(<= ~SIZE~0 2147483647)} is VALID [2018-11-23 12:21:42,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {2371#(<= ~SIZE~0 2147483647)} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {2375#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {2375#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2379#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {2379#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2383#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {2383#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2387#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {2387#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2391#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {2391#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2395#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {2395#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2399#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {2399#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2403#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {2403#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2407#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {2407#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2411#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {2411#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2411#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,694 INFO L273 TraceCheckUtils]: 17: Hoare triple {2411#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2418#(or (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (* 8 (mod main_~i~0 4294967296)) 16) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset| (- 34359738368))) (* main_~i~0 main_~i~0)) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (< 2147483647 (mod main_~i~0 4294967296)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (* 8 (mod main_~i~0 4294967296)) 8) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 24 (* 8 (mod main_~i~0 4294967296))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (* 8 (mod main_~i~0 4294967296))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0) (= 32 (* 8 (mod main_~i~0 4294967296)))) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (<= (mod main_~i~0 4294967296) 2147483647) (= |main_~#a~0.offset| 0)))} is VALID [2018-11-23 12:21:42,718 INFO L273 TraceCheckUtils]: 18: Hoare triple {2418#(or (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (* 8 (mod main_~i~0 4294967296)) 16) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset| (- 34359738368))) (* main_~i~0 main_~i~0)) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (< 2147483647 (mod main_~i~0 4294967296)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (* 8 (mod main_~i~0 4294967296)) 8) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 24 (* 8 (mod main_~i~0 4294967296))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (* 8 (mod main_~i~0 4294967296))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0) (= 32 (* 8 (mod main_~i~0 4294967296)))) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (<= (mod main_~i~0 4294967296) 2147483647) (= |main_~#a~0.offset| 0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2422#(or (and (= (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) 24) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) 32) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) 16) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) 8) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset| (- 34359738368)))) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (< 2147483647 (mod (+ main_~i~0 4294967295) 4294967296)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) 0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (<= (mod (+ main_~i~0 4294967295) 4294967296) 2147483647) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)))} is VALID [2018-11-23 12:21:42,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {2422#(or (and (= (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) 24) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) 32) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) 16) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) 8) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset| (- 34359738368)))) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (< 2147483647 (mod (+ main_~i~0 4294967295) 4294967296)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) 0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)) (and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (* (+ main_~i~0 (- 1)) (+ main_~i~0 (- 1))) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod (+ main_~i~0 4294967295) 4294967296)) |main_~#a~0.offset|))) (<= ~SIZE~0 2147483647) (< main_~i~0 (+ ~SIZE~0 1)) (< 1 ~SIZE~0) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (<= (mod (+ main_~i~0 4294967295) 4294967296) 2147483647) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0)))} assume !(~i~0 < ~SIZE~0); {2426#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,730 INFO L273 TraceCheckUtils]: 20: Hoare triple {2426#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {2430#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:42,731 INFO L273 TraceCheckUtils]: 21: Hoare triple {2430#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2434#(and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:42,732 INFO L256 TraceCheckUtils]: 22: Hoare triple {2434#(and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {2438#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:21:42,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {2438#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2442#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:21:42,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {2442#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2352#false} is VALID [2018-11-23 12:21:42,734 INFO L273 TraceCheckUtils]: 25: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2018-11-23 12:21:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:42,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:21:42,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-11-23 12:21:42,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 12:21:42,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:42,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:21:44,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:44,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:21:44,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:21:44,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:21:44,813 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 20 states. [2018-11-23 12:21:45,756 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 12:21:46,169 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 41 [2018-11-23 12:21:46,516 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-11-23 12:21:52,855 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-11-23 12:21:53,618 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 39 [2018-11-23 12:21:54,197 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2018-11-23 12:21:54,455 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 43 [2018-11-23 12:21:54,841 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 39 [2018-11-23 12:21:56,308 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 93 DAG size of output: 38 [2018-11-23 12:22:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:00,520 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-11-23 12:22:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:22:00,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 12:22:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:22:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 93 transitions. [2018-11-23 12:22:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:22:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 93 transitions. [2018-11-23 12:22:00,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 93 transitions. [2018-11-23 12:22:00,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:00,732 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:22:00,732 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 12:22:00,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:22:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 12:22:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 49. [2018-11-23 12:22:00,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:00,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 49 states. [2018-11-23 12:22:00,970 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 49 states. [2018-11-23 12:22:00,970 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 49 states. [2018-11-23 12:22:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:00,975 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-23 12:22:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-23 12:22:00,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:00,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:00,976 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 98 states. [2018-11-23 12:22:00,976 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 98 states. [2018-11-23 12:22:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:00,980 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-23 12:22:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-23 12:22:00,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:00,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:00,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:00,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:22:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-23 12:22:00,983 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 26 [2018-11-23 12:22:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:00,984 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-23 12:22:00,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:22:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 12:22:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:22:00,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:00,985 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:00,985 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:00,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash -147701925, now seen corresponding path program 2 times [2018-11-23 12:22:00,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:00,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:00,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:00,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:00,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:00,992 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:22:00,992 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:22:00,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:22:01,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:22:01,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:22:01,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:01,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:01,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-23 12:22:01,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:22:01,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:19 [2018-11-23 12:22:01,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 12:22:01,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:01,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:01,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 12:22:01,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-23 12:22:01,465 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:01,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-23 12:22:01,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:01,486 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:22:01,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:01,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-23 12:22:01,493 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:01,502 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:83, output treesize:7 [2018-11-23 12:22:01,507 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:01,508 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|, v_prenex_40, v_prenex_39, v_prenex_41]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse3 (<= .cse5 2147483647)) (.cse1 (* 8 .cse5)) (.cse2 (= main_~i~0 1))) (or (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= 1 (select .cse0 (+ |main_~#a~0.offset| 8))) (= (select .cse0 (+ .cse1 |main_~#a~0.offset|)) |main_#t~mem4|) .cse2 (= 4 (select .cse0 (+ |main_~#a~0.offset| 16))) .cse3)) (let ((.cse4 (select v_prenex_40 v_prenex_39))) (and (= 4 (select .cse4 (+ v_prenex_41 16))) (not .cse3) (= 1 (select .cse4 (+ v_prenex_41 8))) (= (select .cse4 (+ .cse1 v_prenex_41 (- 34359738368))) |main_#t~mem4|) .cse2))))) [2018-11-23 12:22:01,508 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (= 1 |main_#t~mem4|)) [2018-11-23 12:22:01,548 INFO L256 TraceCheckUtils]: 0: Hoare triple {2883#true} call ULTIMATE.init(); {2883#true} is VALID [2018-11-23 12:22:01,549 INFO L273 TraceCheckUtils]: 1: Hoare triple {2883#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2883#true} is VALID [2018-11-23 12:22:01,549 INFO L273 TraceCheckUtils]: 2: Hoare triple {2883#true} assume true; {2883#true} is VALID [2018-11-23 12:22:01,549 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2883#true} {2883#true} #56#return; {2883#true} is VALID [2018-11-23 12:22:01,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {2883#true} call #t~ret5 := main(); {2883#true} is VALID [2018-11-23 12:22:01,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {2883#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2883#true} is VALID [2018-11-23 12:22:01,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {2883#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {2906#(= main_~i~0 0)} is VALID [2018-11-23 12:22:01,551 INFO L273 TraceCheckUtils]: 7: Hoare triple {2906#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2906#(= main_~i~0 0)} is VALID [2018-11-23 12:22:01,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {2906#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2913#(= main_~i~0 1)} is VALID [2018-11-23 12:22:01,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {2913#(= main_~i~0 1)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2917#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} is VALID [2018-11-23 12:22:01,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {2917#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2921#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))))} is VALID [2018-11-23 12:22:01,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {2921#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2925#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:01,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {2925#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2925#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:01,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {2925#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !(~i~0 < ~SIZE~0); {2925#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:01,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {2925#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} ~i~0 := 0; {2935#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:01,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {2935#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2935#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:01,596 INFO L256 TraceCheckUtils]: 16: Hoare triple {2935#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {2942#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 16)) 4) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 8)))))} is VALID [2018-11-23 12:22:01,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {2942#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 16)) 4) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 8)))))} ~cond := #in~cond; {2946#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 16)) 4) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 8))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:22:01,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {2946#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 16)) 4) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 8))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {2950#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 16)) 4) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 8))))))} is VALID [2018-11-23 12:22:01,598 INFO L273 TraceCheckUtils]: 19: Hoare triple {2950#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 16)) 4) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 8))))))} assume true; {2950#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 16)) 4) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 8))))))} is VALID [2018-11-23 12:22:01,598 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2950#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 16)) 4) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 8))))))} {2935#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} #60#return; {2935#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:01,599 INFO L273 TraceCheckUtils]: 21: Hoare triple {2935#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} havoc #t~mem4; {2935#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:01,600 INFO L273 TraceCheckUtils]: 22: Hoare triple {2935#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2963#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:01,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {2963#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {2967#(and (= main_~i~0 1) (= 1 |main_#t~mem4|))} is VALID [2018-11-23 12:22:01,608 INFO L256 TraceCheckUtils]: 24: Hoare triple {2967#(and (= main_~i~0 1) (= 1 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {2971#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:01,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {2971#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2975#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:01,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {2975#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2884#false} is VALID [2018-11-23 12:22:01,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {2884#false} assume !false; {2884#false} is VALID [2018-11-23 12:22:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:01,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:22:01,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-23 12:22:01,631 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-11-23 12:22:01,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:01,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:22:01,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:01,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:22:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:22:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:22:01,666 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 15 states. [2018-11-23 12:22:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:03,374 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-23 12:22:03,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:22:03,375 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-11-23 12:22:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:22:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2018-11-23 12:22:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:22:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2018-11-23 12:22:03,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2018-11-23 12:22:03,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:03,498 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:22:03,498 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:22:03,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:22:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:22:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 49. [2018-11-23 12:22:03,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:03,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 49 states. [2018-11-23 12:22:03,695 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 49 states. [2018-11-23 12:22:03,695 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 49 states. [2018-11-23 12:22:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:03,698 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-11-23 12:22:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-11-23 12:22:03,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:03,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:03,699 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 90 states. [2018-11-23 12:22:03,700 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 90 states. [2018-11-23 12:22:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:03,702 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-11-23 12:22:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-11-23 12:22:03,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:03,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:03,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:03,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:22:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-23 12:22:03,705 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 28 [2018-11-23 12:22:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:03,705 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-23 12:22:03,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:22:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 12:22:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:22:03,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:03,706 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:03,707 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:03,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:03,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1212897824, now seen corresponding path program 7 times [2018-11-23 12:22:03,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:03,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:03,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:03,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:03,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:03,713 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:22:03,714 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:22:03,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:22:03,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:03,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:03,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-23 12:22:03,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:22:03,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:03,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:04,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:04,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:19 [2018-11-23 12:22:04,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-23 12:22:04,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:04,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:04,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 43 [2018-11-23 12:22:04,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:04,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:04,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:04,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:26 [2018-11-23 12:22:04,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-11-23 12:22:04,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:04,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:04,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:04,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:04,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:04,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:04,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 96 [2018-11-23 12:22:04,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:04,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:35 [2018-11-23 12:22:05,118 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:05,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-23 12:22:05,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 173 [2018-11-23 12:22:05,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,266 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:109, output treesize:44 [2018-11-23 12:22:05,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2018-11-23 12:22:05,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 274 [2018-11-23 12:22:05,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:53 [2018-11-23 12:22:05,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-11-23 12:22:05,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 399 [2018-11-23 12:22:05,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:145, output treesize:62 [2018-11-23 12:22:06,774 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 12:22:06,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-11-23 12:22:06,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 506 [2018-11-23 12:22:06,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:07,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:07,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:07,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:62 [2018-11-23 12:22:07,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67 [2018-11-23 12:22:07,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,348 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:22:07,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:07,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 42 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 235 [2018-11-23 12:22:07,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:07,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:07,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:07,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:169, output treesize:7 [2018-11-23 12:22:07,488 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:07,488 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|, v_prenex_49, v_prenex_48, v_prenex_50]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse2 (* 8 .cse5)) (.cse0 (<= .cse5 2147483647)) (.cse3 (= main_~i~0 0))) (or (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (and (not .cse0) (= 9 (select .cse1 (+ |main_~#a~0.offset| 24))) (= 1 (select .cse1 (+ |main_~#a~0.offset| 8))) (= (select .cse1 (+ |main_~#a~0.offset| 40)) 25) (= (select .cse1 (+ .cse2 |main_~#a~0.offset| (- 34359738368))) |main_#t~mem4|) (= 36 (select .cse1 (+ |main_~#a~0.offset| 48))) (= 4 (select .cse1 (+ |main_~#a~0.offset| 16))) (= 0 (select .cse1 |main_~#a~0.offset|)) (= 16 (select .cse1 (+ |main_~#a~0.offset| 32))) .cse3)) (let ((.cse4 (select v_prenex_49 v_prenex_48))) (and (= 1 (select .cse4 (+ v_prenex_50 8))) (= 36 (select .cse4 (+ v_prenex_50 48))) (= (select .cse4 (+ .cse2 v_prenex_50)) |main_#t~mem4|) (= 16 (select .cse4 (+ v_prenex_50 32))) (= 0 (select .cse4 v_prenex_50)) (= 9 (select .cse4 (+ v_prenex_50 24))) (= (select .cse4 (+ v_prenex_50 40)) 25) (= 4 (select .cse4 (+ v_prenex_50 16))) .cse0 .cse3))))) [2018-11-23 12:22:07,489 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem4|) (= main_~i~0 0)) [2018-11-23 12:22:07,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {3371#true} call ULTIMATE.init(); {3371#true} is VALID [2018-11-23 12:22:07,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {3371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3371#true} is VALID [2018-11-23 12:22:07,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {3371#true} assume true; {3371#true} is VALID [2018-11-23 12:22:07,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3371#true} {3371#true} #56#return; {3371#true} is VALID [2018-11-23 12:22:07,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {3371#true} call #t~ret5 := main(); {3371#true} is VALID [2018-11-23 12:22:07,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {3371#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3371#true} is VALID [2018-11-23 12:22:07,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {3371#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {3394#(= main_~i~0 0)} is VALID [2018-11-23 12:22:07,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {3394#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3398#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0))} is VALID [2018-11-23 12:22:07,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {3398#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3402#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:22:07,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {3402#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3406#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:22:07,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {3406#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3410#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:22:07,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {3410#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3414#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:22:07,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {3414#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3418#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:22:07,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {3418#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3422#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-23 12:22:07,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {3422#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3426#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4))} is VALID [2018-11-23 12:22:07,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {3426#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3430#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4))} is VALID [2018-11-23 12:22:07,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {3430#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3434#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:22:07,574 INFO L273 TraceCheckUtils]: 17: Hoare triple {3434#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3438#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:22:07,576 INFO L273 TraceCheckUtils]: 18: Hoare triple {3438#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3442#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 6) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:22:07,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {3442#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 6) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3446#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:22:07,579 INFO L273 TraceCheckUtils]: 20: Hoare triple {3446#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3446#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:22:07,580 INFO L273 TraceCheckUtils]: 21: Hoare triple {3446#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} assume !(~i~0 < ~SIZE~0); {3446#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:22:07,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {3446#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} ~i~0 := 0; {3456#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:07,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {3456#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3460#(and (= 0 |main_#t~mem4|) (= main_~i~0 0))} is VALID [2018-11-23 12:22:07,588 INFO L256 TraceCheckUtils]: 24: Hoare triple {3460#(and (= 0 |main_#t~mem4|) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {3464#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:07,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {3464#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3468#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:07,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {3468#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3372#false} is VALID [2018-11-23 12:22:07,589 INFO L273 TraceCheckUtils]: 27: Hoare triple {3372#false} assume !false; {3372#false} is VALID [2018-11-23 12:22:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:07,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:22:07,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-11-23 12:22:07,612 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-11-23 12:22:07,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:07,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:22:07,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:07,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:22:07,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:22:07,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:22:07,653 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 20 states. [2018-11-23 12:22:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:13,282 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2018-11-23 12:22:13,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:22:13,283 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-11-23 12:22:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:22:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 108 transitions. [2018-11-23 12:22:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:22:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 108 transitions. [2018-11-23 12:22:13,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 108 transitions. [2018-11-23 12:22:13,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:13,546 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:22:13,547 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:22:13,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:22:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:22:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2018-11-23 12:22:13,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:13,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 51 states. [2018-11-23 12:22:13,677 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 51 states. [2018-11-23 12:22:13,677 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 51 states. [2018-11-23 12:22:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:13,681 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-11-23 12:22:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-11-23 12:22:13,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:13,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:13,682 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 107 states. [2018-11-23 12:22:13,682 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 107 states. [2018-11-23 12:22:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:13,686 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-11-23 12:22:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-11-23 12:22:13,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:13,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:13,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:13,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:22:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-23 12:22:13,688 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 28 [2018-11-23 12:22:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:13,688 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-23 12:22:13,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:22:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 12:22:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:22:13,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:13,689 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:13,690 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:13,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:13,690 INFO L82 PathProgramCache]: Analyzing trace with hash 209812825, now seen corresponding path program 3 times [2018-11-23 12:22:13,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:13,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:13,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:13,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:13,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:13,697 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:22:13,697 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:22:13,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:22:13,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:22:13,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 12:22:13,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:13,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:14,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-23 12:22:14,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:22:14,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:14,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:14,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:14,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:22 [2018-11-23 12:22:14,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 12:22:14,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:14,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:14,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 49 [2018-11-23 12:22:14,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:14,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:14,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:14,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:31 [2018-11-23 12:22:14,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-23 12:22:14,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:14,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:14,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:14,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:14,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:14,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:14,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 106 [2018-11-23 12:22:14,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:14,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:14,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:14,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:40 [2018-11-23 12:22:15,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-11-23 12:22:15,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:15,319 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:22:15,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:15,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:15,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:15,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:15,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:15,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2018-11-23 12:22:15,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:15,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:15,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:15,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:7 [2018-11-23 12:22:15,363 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:15,363 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_55, v_prenex_54, v_prenex_56, |#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse3 (<= .cse5 2147483647)) (.cse2 (* 8 .cse5)) (.cse1 (= main_~i~0 1))) (or (let ((.cse0 (select v_prenex_55 v_prenex_54))) (and (= 4 (select .cse0 (+ v_prenex_56 16))) .cse1 (= (select .cse0 (+ .cse2 v_prenex_56)) |main_#t~mem4|) (= 1 (select .cse0 (+ v_prenex_56 8))) (= 9 (select .cse0 (+ v_prenex_56 24))) .cse3)) (let ((.cse4 (select |#memory_int| |main_~#a~0.base|))) (and (not .cse3) (= 9 (select .cse4 (+ |main_~#a~0.offset| 24))) (= 1 (select .cse4 (+ |main_~#a~0.offset| 8))) (= (select .cse4 (+ .cse2 |main_~#a~0.offset| (- 34359738368))) |main_#t~mem4|) .cse1 (= 4 (select .cse4 (+ |main_~#a~0.offset| 16)))))))) [2018-11-23 12:22:15,363 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (= 1 |main_#t~mem4|)) [2018-11-23 12:22:15,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {3934#true} call ULTIMATE.init(); {3934#true} is VALID [2018-11-23 12:22:15,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {3934#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3934#true} is VALID [2018-11-23 12:22:15,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {3934#true} assume true; {3934#true} is VALID [2018-11-23 12:22:15,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3934#true} {3934#true} #56#return; {3934#true} is VALID [2018-11-23 12:22:15,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {3934#true} call #t~ret5 := main(); {3934#true} is VALID [2018-11-23 12:22:15,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {3934#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3934#true} is VALID [2018-11-23 12:22:15,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {3934#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {3957#(and (< 1 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:15,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {3957#(and (< 1 ~SIZE~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3957#(and (< 1 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:15,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {3957#(and (< 1 ~SIZE~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3964#(and (< 1 ~SIZE~0) (= main_~i~0 1))} is VALID [2018-11-23 12:22:15,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {3964#(and (< 1 ~SIZE~0) (= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3968#(and (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} is VALID [2018-11-23 12:22:15,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {3968#(and (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3972#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (< 1 ~SIZE~0))} is VALID [2018-11-23 12:22:15,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {3972#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (< 1 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3976#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} is VALID [2018-11-23 12:22:15,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {3976#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3980#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:15,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {3980#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3984#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:15,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {3984#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3988#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (< 1 ~SIZE~0) (<= main_~i~0 4) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:15,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {3988#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (< 1 ~SIZE~0) (<= main_~i~0 4) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !(~i~0 < ~SIZE~0); {3992#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:15,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {3992#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} ~i~0 := 0; {3996#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:15,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {3996#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {3996#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:15,496 INFO L256 TraceCheckUtils]: 18: Hoare triple {3996#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {4003#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 24)) 9) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 16)) 4)))} is VALID [2018-11-23 12:22:15,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {4003#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 24)) 9) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 16)) 4)))} ~cond := #in~cond; {4007#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 24)) 9) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 16)) 4))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:22:15,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {4007#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 24)) 9) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 16)) 4))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {4011#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 24)) 9) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 16)) 4))) (not (= |__VERIFIER_assert_#in~cond| 0)))} is VALID [2018-11-23 12:22:15,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {4011#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 24)) 9) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 16)) 4))) (not (= |__VERIFIER_assert_#in~cond| 0)))} assume true; {4011#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 24)) 9) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 16)) 4))) (not (= |__VERIFIER_assert_#in~cond| 0)))} is VALID [2018-11-23 12:22:15,504 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {4011#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 24)) 9) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 16)) 4))) (not (= |__VERIFIER_assert_#in~cond| 0)))} {3996#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} #60#return; {3996#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:15,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {3996#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} havoc #t~mem4; {3996#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:15,509 INFO L273 TraceCheckUtils]: 24: Hoare triple {3996#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4024#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:15,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {4024#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {4028#(and (= main_~i~0 1) (= 1 |main_#t~mem4|))} is VALID [2018-11-23 12:22:15,513 INFO L256 TraceCheckUtils]: 26: Hoare triple {4028#(and (= main_~i~0 1) (= 1 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {4032#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:15,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {4032#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4036#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:15,514 INFO L273 TraceCheckUtils]: 28: Hoare triple {4036#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3935#false} is VALID [2018-11-23 12:22:15,515 INFO L273 TraceCheckUtils]: 29: Hoare triple {3935#false} assume !false; {3935#false} is VALID [2018-11-23 12:22:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:15,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:22:15,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-11-23 12:22:15,546 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-11-23 12:22:15,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:15,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:22:15,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:15,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:22:15,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:22:15,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:22:15,603 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 19 states. [2018-11-23 12:22:17,479 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-11-23 12:22:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:18,978 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-11-23 12:22:18,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:22:18,978 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-11-23 12:22:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:22:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 86 transitions. [2018-11-23 12:22:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:22:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 86 transitions. [2018-11-23 12:22:18,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 86 transitions. [2018-11-23 12:22:19,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:19,144 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:22:19,144 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:22:19,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:22:19,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:22:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 51. [2018-11-23 12:22:19,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:19,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 51 states. [2018-11-23 12:22:19,287 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 51 states. [2018-11-23 12:22:19,287 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 51 states. [2018-11-23 12:22:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:19,289 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-11-23 12:22:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2018-11-23 12:22:19,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:19,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:19,290 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 95 states. [2018-11-23 12:22:19,290 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 95 states. [2018-11-23 12:22:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:19,293 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-11-23 12:22:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2018-11-23 12:22:19,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:19,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:19,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:19,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:22:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-23 12:22:19,296 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 30 [2018-11-23 12:22:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:19,296 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-23 12:22:19,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:22:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 12:22:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:22:19,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:19,297 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:19,297 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:19,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:19,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1570412574, now seen corresponding path program 8 times [2018-11-23 12:22:19,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:19,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:19,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:19,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:19,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:19,304 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:22:19,305 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:22:19,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:22:19,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:22:19,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:22:19,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:19,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:20,133 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:20,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:20,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-23 12:22:20,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:22:20,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:20,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:20,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:20,691 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:22 [2018-11-23 12:22:20,904 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 12:22:20,945 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:20,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:20,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:22:20,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:20,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:20,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 43 [2018-11-23 12:22:20,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:20,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:20,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:20,992 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:79, output treesize:29 [2018-11-23 12:22:21,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-11-23 12:22:21,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 96 [2018-11-23 12:22:21,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:38 [2018-11-23 12:22:21,244 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:21,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-23 12:22:21,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 173 [2018-11-23 12:22:21,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,342 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:115, output treesize:47 [2018-11-23 12:22:21,510 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:21,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-23 12:22:21,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 274 [2018-11-23 12:22:21,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,646 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:133, output treesize:56 [2018-11-23 12:22:21,918 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:21,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:21,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2018-11-23 12:22:21,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,967 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:21,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 399 [2018-11-23 12:22:21,993 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:22,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:22,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:22,096 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:151, output treesize:65 [2018-11-23 12:22:22,258 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:22,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:22,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2018-11-23 12:22:22,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 548 [2018-11-23 12:22:22,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:22,500 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:22,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:22,523 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:169, output treesize:74 [2018-11-23 12:22:22,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 58 [2018-11-23 12:22:22,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:22,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 56 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 673 [2018-11-23 12:22:22,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:22,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:23,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:23,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:74 [2018-11-23 12:22:23,265 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:23,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:23,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2018-11-23 12:22:23,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,354 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:22:23,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:23,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 60 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 119 [2018-11-23 12:22:23,412 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:23,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:23,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:23,439 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:156, output treesize:11 [2018-11-23 12:22:23,444 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:23,444 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_65, v_prenex_64, |#memory_int|, |main_~#a~0.base|]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse2 (* 8 .cse5)) (.cse0 (<= .cse5 2147483647)) (.cse3 (= main_~i~0 0))) (or (let ((.cse1 (select v_prenex_65 v_prenex_64))) (and (not .cse0) (= 16 (select .cse1 32)) (= (select .cse1 56) 49) (= 1 (select .cse1 8)) (= 4 (select .cse1 16)) (= 9 (select .cse1 24)) (= (select .cse1 40) 25) (= (select .cse1 0) 0) (= 36 (select .cse1 48)) (= |main_#t~mem4| (select .cse1 (+ .cse2 (- 34359738368)))) .cse3)) (let ((.cse4 (select |#memory_int| |main_~#a~0.base|))) (and (= |main_#t~mem4| (select .cse4 .cse2)) (= 36 (select .cse4 48)) (= 4 (select .cse4 16)) (= 9 (select .cse4 24)) (= (select .cse4 56) 49) (= (select .cse4 40) 25) (= 16 (select .cse4 32)) (= 1 (select .cse4 8)) (= (select .cse4 0) 0) .cse0 .cse3))))) [2018-11-23 12:22:23,444 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0)) [2018-11-23 12:22:23,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {4455#true} call ULTIMATE.init(); {4455#true} is VALID [2018-11-23 12:22:23,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {4455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4455#true} is VALID [2018-11-23 12:22:23,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {4455#true} assume true; {4455#true} is VALID [2018-11-23 12:22:23,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4455#true} {4455#true} #56#return; {4455#true} is VALID [2018-11-23 12:22:23,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {4455#true} call #t~ret5 := main(); {4455#true} is VALID [2018-11-23 12:22:23,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {4455#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4455#true} is VALID [2018-11-23 12:22:23,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {4455#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {4478#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {4478#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {4482#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {4482#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4486#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {4486#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {4490#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {4490#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4494#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {4494#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {4498#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {4498#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4502#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {4502#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {4506#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {4506#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4510#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {4510#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {4514#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {4514#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4518#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {4518#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {4522#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {4522#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4526#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 6) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {4526#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 6) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {4530#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 6) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {4530#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 6) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4534#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 7) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {4534#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 7) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {4538#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {4538#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4538#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,546 INFO L273 TraceCheckUtils]: 23: Hoare triple {4538#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {4538#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {4538#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {4548#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:23,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {4548#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {4552#(and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:23,550 INFO L256 TraceCheckUtils]: 26: Hoare triple {4552#(and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {4556#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:23,551 INFO L273 TraceCheckUtils]: 27: Hoare triple {4556#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4560#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:23,551 INFO L273 TraceCheckUtils]: 28: Hoare triple {4560#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4456#false} is VALID [2018-11-23 12:22:23,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {4456#false} assume !false; {4456#false} is VALID [2018-11-23 12:22:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:23,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:22:23,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-23 12:22:23,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-11-23 12:22:23,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:23,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:22:23,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:23,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:22:23,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:22:23,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:22:23,624 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 22 states. [2018-11-23 12:22:24,502 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 12:22:29,050 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-11-23 12:22:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:32,690 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2018-11-23 12:22:32,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:22:32,690 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-11-23 12:22:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:22:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 112 transitions. [2018-11-23 12:22:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:22:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 112 transitions. [2018-11-23 12:22:32,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 112 transitions. [2018-11-23 12:22:33,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:33,559 INFO L225 Difference]: With dead ends: 112 [2018-11-23 12:22:33,559 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 12:22:33,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:22:33,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 12:22:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 53. [2018-11-23 12:22:33,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:33,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 53 states. [2018-11-23 12:22:33,744 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 53 states. [2018-11-23 12:22:33,744 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 53 states. [2018-11-23 12:22:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:33,747 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2018-11-23 12:22:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2018-11-23 12:22:33,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:33,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:33,748 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 110 states. [2018-11-23 12:22:33,748 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 110 states. [2018-11-23 12:22:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:33,751 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2018-11-23 12:22:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2018-11-23 12:22:33,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:33,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:33,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:33,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:22:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-23 12:22:33,754 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 30 [2018-11-23 12:22:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:33,755 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-23 12:22:33,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:22:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 12:22:33,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:22:33,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:33,755 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:33,756 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:33,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:33,756 INFO L82 PathProgramCache]: Analyzing trace with hash 184103895, now seen corresponding path program 4 times [2018-11-23 12:22:33,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:33,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:33,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:33,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:33,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:33,775 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:22:33,776 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:22:33,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:22:33,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:22:33,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:22:33,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:33,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:34,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-23 12:22:34,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:22:34,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:19 [2018-11-23 12:22:34,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-11-23 12:22:34,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 49 [2018-11-23 12:22:34,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:28 [2018-11-23 12:22:34,449 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:34,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 12:22:34,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 106 [2018-11-23 12:22:34,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,523 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,535 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:95, output treesize:37 [2018-11-23 12:22:34,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-11-23 12:22:34,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:34,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-11-23 12:22:34,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:34,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-23 12:22:35,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-23 12:22:35,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,053 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:22:35,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:35,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 103 [2018-11-23 12:22:35,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:35,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:35,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:35,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:119, output treesize:7 [2018-11-23 12:22:35,107 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:35,107 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|, v_prenex_70, v_prenex_69, v_prenex_71]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse2 (* 8 .cse5)) (.cse3 (= main_~i~0 1)) (.cse0 (<= .cse5 2147483647))) (or (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (and (not .cse0) (= 9 (select .cse1 (+ |main_~#a~0.offset| 24))) (= 1 (select .cse1 (+ |main_~#a~0.offset| 8))) (= (select .cse1 (+ .cse2 |main_~#a~0.offset| (- 34359738368))) |main_#t~mem4|) .cse3 (= 4 (select .cse1 (+ |main_~#a~0.offset| 16))) (= 16 (select .cse1 (+ |main_~#a~0.offset| 32))))) (let ((.cse4 (select v_prenex_70 v_prenex_69))) (and (= (select .cse4 (+ .cse2 v_prenex_71)) |main_#t~mem4|) (= 9 (select .cse4 (+ v_prenex_71 24))) (= 1 (select .cse4 (+ v_prenex_71 8))) (= 16 (select .cse4 (+ v_prenex_71 32))) .cse3 (= 4 (select .cse4 (+ v_prenex_71 16))) .cse0))))) [2018-11-23 12:22:35,107 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (= 1 |main_#t~mem4|)) [2018-11-23 12:22:35,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {5041#true} call ULTIMATE.init(); {5041#true} is VALID [2018-11-23 12:22:35,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {5041#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {5041#true} is VALID [2018-11-23 12:22:35,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {5041#true} assume true; {5041#true} is VALID [2018-11-23 12:22:35,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5041#true} {5041#true} #56#return; {5041#true} is VALID [2018-11-23 12:22:35,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {5041#true} call #t~ret5 := main(); {5041#true} is VALID [2018-11-23 12:22:35,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {5041#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {5041#true} is VALID [2018-11-23 12:22:35,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {5041#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {5064#(= main_~i~0 0)} is VALID [2018-11-23 12:22:35,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {5064#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5064#(= main_~i~0 0)} is VALID [2018-11-23 12:22:35,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {5064#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5071#(= main_~i~0 1)} is VALID [2018-11-23 12:22:35,168 INFO L273 TraceCheckUtils]: 9: Hoare triple {5071#(= main_~i~0 1)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5075#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} is VALID [2018-11-23 12:22:35,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {5075#(and (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5079#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))))} is VALID [2018-11-23 12:22:35,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {5079#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5083#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} is VALID [2018-11-23 12:22:35,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {5083#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5087#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:35,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {5087#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5091#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:22:35,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {5091#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5095#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 4))} is VALID [2018-11-23 12:22:35,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {5095#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5099#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:22:35,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {5099#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5099#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:22:35,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {5099#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} assume !(~i~0 < ~SIZE~0); {5099#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:22:35,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {5099#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} ~i~0 := 0; {5109#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:35,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {5109#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5109#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:35,181 INFO L256 TraceCheckUtils]: 20: Hoare triple {5109#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {5116#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 24)) 9) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 32))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 16)) 4)))} is VALID [2018-11-23 12:22:35,182 INFO L273 TraceCheckUtils]: 21: Hoare triple {5116#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 24)) 9) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 32))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 16)) 4)))} ~cond := #in~cond; {5120#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 24)) 9) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 32))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 16)) 4))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:22:35,185 INFO L273 TraceCheckUtils]: 22: Hoare triple {5120#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 24)) 9) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 32))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 16)) 4))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {5124#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 24)) 9) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 32))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 16)) 4))))} is VALID [2018-11-23 12:22:35,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {5124#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 24)) 9) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 32))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 16)) 4))))} assume true; {5124#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 24)) 9) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 32))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 16)) 4))))} is VALID [2018-11-23 12:22:35,186 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {5124#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int)) (and (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 8))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 24)) 9) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 32))) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 16)) 4))))} {5109#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} #60#return; {5109#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:35,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {5109#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} havoc #t~mem4; {5109#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:35,187 INFO L273 TraceCheckUtils]: 26: Hoare triple {5109#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5137#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:22:35,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {5137#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5141#(and (= main_~i~0 1) (= 1 |main_#t~mem4|))} is VALID [2018-11-23 12:22:35,189 INFO L256 TraceCheckUtils]: 28: Hoare triple {5141#(and (= main_~i~0 1) (= 1 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {5145#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:35,190 INFO L273 TraceCheckUtils]: 29: Hoare triple {5145#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5149#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:35,190 INFO L273 TraceCheckUtils]: 30: Hoare triple {5149#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5042#false} is VALID [2018-11-23 12:22:35,191 INFO L273 TraceCheckUtils]: 31: Hoare triple {5042#false} assume !false; {5042#false} is VALID [2018-11-23 12:22:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:35,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:22:35,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-11-23 12:22:35,218 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-11-23 12:22:35,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:35,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:22:35,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:35,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:22:35,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:22:35,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:22:35,264 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 19 states. [2018-11-23 12:22:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:38,746 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2018-11-23 12:22:38,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:22:38,746 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-11-23 12:22:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:22:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2018-11-23 12:22:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:22:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2018-11-23 12:22:38,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 90 transitions. [2018-11-23 12:22:39,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:39,229 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:22:39,229 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:22:39,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:22:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:22:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 53. [2018-11-23 12:22:39,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:39,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 53 states. [2018-11-23 12:22:39,428 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 53 states. [2018-11-23 12:22:39,428 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 53 states. [2018-11-23 12:22:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:39,433 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-11-23 12:22:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-11-23 12:22:39,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:39,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:39,434 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 104 states. [2018-11-23 12:22:39,434 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 104 states. [2018-11-23 12:22:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:39,436 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-11-23 12:22:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-11-23 12:22:39,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:39,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:39,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:39,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:22:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-23 12:22:39,439 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 32 [2018-11-23 12:22:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:39,439 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-23 12:22:39,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:22:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 12:22:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:22:39,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:39,439 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:39,440 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:39,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1544703644, now seen corresponding path program 9 times [2018-11-23 12:22:39,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:39,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:39,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:39,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:39,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:39,445 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:22:39,445 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:22:39,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:22:39,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:22:45,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:22:45,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:45,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:45,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-11-23 12:22:45,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:22:45,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:28 [2018-11-23 12:22:45,923 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:45,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:22:45,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:45,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:45,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 43 [2018-11-23 12:22:45,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,979 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:91, output treesize:35 [2018-11-23 12:22:46,128 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:46,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:46,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 12:22:46,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 96 [2018-11-23 12:22:46,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:46,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:46,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:46,282 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:115, output treesize:44 [2018-11-23 12:22:46,474 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:46,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:46,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-23 12:22:46,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:46,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 173 [2018-11-23 12:22:46,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:46,598 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:46,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:46,618 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:133, output treesize:53 [2018-11-23 12:22:46,958 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:46,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-23 12:22:47,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 274 [2018-11-23 12:22:47,036 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,114 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:145, output treesize:62 [2018-11-23 12:22:47,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 67 [2018-11-23 12:22:47,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 399 [2018-11-23 12:22:47,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:71 [2018-11-23 12:22:48,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 74 [2018-11-23 12:22:48,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 548 [2018-11-23 12:22:48,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:48,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:48,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:48,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:181, output treesize:80 [2018-11-23 12:22:48,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 81 [2018-11-23 12:22:48,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:48,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 56 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 721 [2018-11-23 12:22:48,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:49,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:49,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:49,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:199, output treesize:89 [2018-11-23 12:22:49,604 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:22:49,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:49,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 71 [2018-11-23 12:22:49,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,697 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:49,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 72 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 918 [2018-11-23 12:22:49,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:50,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:50,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:50,086 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:223, output treesize:98 [2018-11-23 12:22:50,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 63 [2018-11-23 12:22:50,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,646 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:22:50,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,697 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:50,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 76 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 127 [2018-11-23 12:22:50,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:50,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:50,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:50,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:170, output treesize:11 [2018-11-23 12:22:50,776 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:50,776 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_82, v_prenex_81, |#memory_int|, |main_~#a~0.base|]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse2 (<= .cse5 2147483647)) (.cse1 (* 8 .cse5)) (.cse3 (= main_~i~0 0))) (or (let ((.cse0 (select v_prenex_82 v_prenex_81))) (and (= |main_#t~mem4| (select .cse0 .cse1)) (= 64 (select .cse0 64)) (= 4 (select .cse0 16)) (= (select .cse0 40) 25) (= 1 (select .cse0 8)) (= 9 (select .cse0 24)) (= 36 (select .cse0 48)) (= (select .cse0 56) 49) (= 16 (select .cse0 32)) (= (select .cse0 0) 0) .cse2 .cse3)) (let ((.cse4 (select |#memory_int| |main_~#a~0.base|))) (and (not .cse2) (= 36 (select .cse4 48)) (= |main_#t~mem4| (select .cse4 (+ .cse1 (- 34359738368)))) (= 64 (select .cse4 64)) (= 4 (select .cse4 16)) (= 9 (select .cse4 24)) (= (select .cse4 56) 49) (= (select .cse4 40) 25) (= 16 (select .cse4 32)) (= 1 (select .cse4 8)) (= (select .cse4 0) 0) .cse3))))) [2018-11-23 12:22:50,776 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0)) [2018-11-23 12:22:50,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5603#true} is VALID [2018-11-23 12:22:50,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {5603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {5603#true} is VALID [2018-11-23 12:22:50,846 INFO L273 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID [2018-11-23 12:22:50,846 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #56#return; {5603#true} is VALID [2018-11-23 12:22:50,846 INFO L256 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret5 := main(); {5603#true} is VALID [2018-11-23 12:22:50,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {5603#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {5623#(<= ~SIZE~0 2147483647)} is VALID [2018-11-23 12:22:50,848 INFO L273 TraceCheckUtils]: 6: Hoare triple {5623#(<= ~SIZE~0 2147483647)} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {5627#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {5627#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5631#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {5631#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5635#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {5635#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5639#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {5639#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5643#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {5643#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5647#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,856 INFO L273 TraceCheckUtils]: 12: Hoare triple {5647#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5651#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 2 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {5651#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 2 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5655#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {5655#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5659#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {5659#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5663#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {5663#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5667#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {5667#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5671#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,867 INFO L273 TraceCheckUtils]: 18: Hoare triple {5671#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 5) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5675#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= main_~i~0 6) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {5675#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= main_~i~0 6) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5679#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= main_~i~0 6) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {5679#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= main_~i~0 6) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5683#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 7) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {5683#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 7) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5687#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 7) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {5687#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= main_~i~0 7) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5691#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= main_~i~0 8) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {5691#(and (< 3 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= main_~i~0 8) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5695#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 8) (< main_~i~0 ~SIZE~0) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,879 INFO L273 TraceCheckUtils]: 24: Hoare triple {5695#(and (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 8) (< main_~i~0 ~SIZE~0) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5699#(and (< 8 ~SIZE~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 64 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 64))) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (<= main_~i~0 9) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {5699#(and (< 8 ~SIZE~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 64 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 64))) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (<= main_~i~0 9) (<= ~SIZE~0 2147483647) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {5703#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 64 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 64))) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {5703#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 64 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 64))) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {5707#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 64 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 64))) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:50,884 INFO L273 TraceCheckUtils]: 27: Hoare triple {5707#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 40)) 25) (= 64 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 64))) (= 36 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 48))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 56)) 49) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {5711#(and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:50,885 INFO L256 TraceCheckUtils]: 28: Hoare triple {5711#(and (= |main_#t~mem4| (* 8 (mod main_~i~0 4294967296))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {5715#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:50,885 INFO L273 TraceCheckUtils]: 29: Hoare triple {5715#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5719#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:50,886 INFO L273 TraceCheckUtils]: 30: Hoare triple {5719#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5604#false} is VALID [2018-11-23 12:22:50,886 INFO L273 TraceCheckUtils]: 31: Hoare triple {5604#false} assume !false; {5604#false} is VALID [2018-11-23 12:22:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:50,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:22:50,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-11-23 12:22:50,915 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2018-11-23 12:22:50,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:50,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:22:50,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:50,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:22:50,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:22:50,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:22:50,971 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 27 states. [2018-11-23 12:22:52,120 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 12:22:54,768 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-11-23 12:22:57,054 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-11-23 12:23:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:01,336 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2018-11-23 12:23:01,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:23:01,336 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2018-11-23 12:23:01,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:23:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 136 transitions. [2018-11-23 12:23:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:23:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 136 transitions. [2018-11-23 12:23:01,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 136 transitions. [2018-11-23 12:23:01,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:01,677 INFO L225 Difference]: With dead ends: 133 [2018-11-23 12:23:01,678 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 12:23:01,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=182, Invalid=1378, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:23:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 12:23:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 55. [2018-11-23 12:23:02,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:02,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 55 states. [2018-11-23 12:23:02,082 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 55 states. [2018-11-23 12:23:02,082 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 55 states. [2018-11-23 12:23:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:02,086 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2018-11-23 12:23:02,086 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2018-11-23 12:23:02,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:02,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:02,087 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 131 states. [2018-11-23 12:23:02,087 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 131 states. [2018-11-23 12:23:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:02,091 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2018-11-23 12:23:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2018-11-23 12:23:02,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:02,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:02,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:02,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:23:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-23 12:23:02,093 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 32 [2018-11-23 12:23:02,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:02,094 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-23 12:23:02,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:23:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-23 12:23:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:23:02,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:02,095 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:02,095 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:02,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:02,095 INFO L82 PathProgramCache]: Analyzing trace with hash 374652176, now seen corresponding path program 5 times [2018-11-23 12:23:02,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:02,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:02,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:02,101 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:23:02,101 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:23:02,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:23:02,124 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:23:02,221 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-11-23 12:23:02,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:23:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:02,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:02,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {6280#true} call ULTIMATE.init(); {6280#true} is VALID [2018-11-23 12:23:02,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {6280#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {6280#true} is VALID [2018-11-23 12:23:02,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {6280#true} assume true; {6280#true} is VALID [2018-11-23 12:23:02,380 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6280#true} {6280#true} #56#return; {6280#true} is VALID [2018-11-23 12:23:02,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {6280#true} call #t~ret5 := main(); {6280#true} is VALID [2018-11-23 12:23:02,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {6280#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6280#true} is VALID [2018-11-23 12:23:02,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {6280#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {6303#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:02,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {6303#(<= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6303#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:02,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {6303#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6310#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:02,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {6310#(<= main_~i~0 1)} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6310#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:02,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {6310#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6317#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:02,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {6317#(<= main_~i~0 2)} assume !(~i~0 < ~SIZE~0); {6321#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:23:02,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {6321#(<= ~SIZE~0 2)} ~i~0 := 0; {6325#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:23:02,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {6325#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6325#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:23:02,386 INFO L256 TraceCheckUtils]: 14: Hoare triple {6325#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {6321#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:23:02,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {6321#(<= ~SIZE~0 2)} ~cond := #in~cond; {6321#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:23:02,387 INFO L273 TraceCheckUtils]: 16: Hoare triple {6321#(<= ~SIZE~0 2)} assume !(0 == ~cond); {6321#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:23:02,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {6321#(<= ~SIZE~0 2)} assume true; {6321#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:23:02,391 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {6321#(<= ~SIZE~0 2)} {6325#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} #60#return; {6325#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:23:02,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {6325#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} havoc #t~mem4; {6325#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:23:02,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {6325#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6350#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:23:02,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {6350#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6350#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:23:02,394 INFO L256 TraceCheckUtils]: 22: Hoare triple {6350#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {6321#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:23:02,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {6321#(<= ~SIZE~0 2)} ~cond := #in~cond; {6321#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:23:02,398 INFO L273 TraceCheckUtils]: 24: Hoare triple {6321#(<= ~SIZE~0 2)} assume !(0 == ~cond); {6321#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:23:02,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {6321#(<= ~SIZE~0 2)} assume true; {6321#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:23:02,399 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {6321#(<= ~SIZE~0 2)} {6350#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} #60#return; {6350#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:23:02,400 INFO L273 TraceCheckUtils]: 27: Hoare triple {6350#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} havoc #t~mem4; {6350#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:23:02,400 INFO L273 TraceCheckUtils]: 28: Hoare triple {6350#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6375#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:23:02,401 INFO L273 TraceCheckUtils]: 29: Hoare triple {6375#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6281#false} is VALID [2018-11-23 12:23:02,401 INFO L256 TraceCheckUtils]: 30: Hoare triple {6281#false} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {6281#false} is VALID [2018-11-23 12:23:02,401 INFO L273 TraceCheckUtils]: 31: Hoare triple {6281#false} ~cond := #in~cond; {6281#false} is VALID [2018-11-23 12:23:02,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {6281#false} assume 0 == ~cond; {6281#false} is VALID [2018-11-23 12:23:02,401 INFO L273 TraceCheckUtils]: 33: Hoare triple {6281#false} assume !false; {6281#false} is VALID [2018-11-23 12:23:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:23:02,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:23:02,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:23:02,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-23 12:23:02,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:02,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:23:02,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:02,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:23:02,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:23:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:23:02,453 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 9 states. [2018-11-23 12:23:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:03,287 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-11-23 12:23:03,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:23:03,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-23 12:23:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:23:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:23:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:23:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:23:03,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:23:03,419 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 12:23:03,420 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:23:03,420 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:23:03,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:23:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:23:03,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2018-11-23 12:23:03,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:03,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 55 states. [2018-11-23 12:23:03,688 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 55 states. [2018-11-23 12:23:03,688 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 55 states. [2018-11-23 12:23:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:03,690 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-11-23 12:23:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2018-11-23 12:23:03,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:03,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:03,691 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 69 states. [2018-11-23 12:23:03,691 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 69 states. [2018-11-23 12:23:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:03,692 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-11-23 12:23:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2018-11-23 12:23:03,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:03,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:03,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:03,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:23:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-11-23 12:23:03,695 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2018-11-23 12:23:03,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:03,695 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-23 12:23:03,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:23:03,695 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 12:23:03,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:23:03,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:03,696 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:03,696 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:03,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:03,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1247625941, now seen corresponding path program 6 times [2018-11-23 12:23:03,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:03,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:03,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:03,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:03,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:03,702 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:23:03,702 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:23:03,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:23:03,721 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:23:04,058 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:23:04,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:23:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:04,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:04,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-11-23 12:23:04,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:23:04,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:25 [2018-11-23 12:23:04,417 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:23:04,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-23 12:23:04,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 49 [2018-11-23 12:23:04,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,458 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,469 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:89, output treesize:34 [2018-11-23 12:23:04,556 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:23:04,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 12:23:04,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 106 [2018-11-23 12:23:04,598 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,618 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,632 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:107, output treesize:43 [2018-11-23 12:23:04,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-11-23 12:23:04,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-11-23 12:23:04,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:04,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2018-11-23 12:23:04,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 59 [2018-11-23 12:23:04,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:04,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:05,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:05,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:05,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:05,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:07,069 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimCell_72 (+ |main_~#a~0.offset| 24)) (* main_~i~0 main_~i~0)) [2018-11-23 12:23:07,125 INFO L303 Elim1Store]: Index analysis took 2153 ms [2018-11-23 12:23:07,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 45 treesize of output 148 [2018-11-23 12:23:07,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2018-11-23 12:23:07,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 12:23:07,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-11-23 12:23:07,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:07,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:07,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:07,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:08,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:08,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:08,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:08,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:08,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:08,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:08,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:08,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:08,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:10,171 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimCell_73 (+ |main_~#a~0.offset| 32)) (* main_~i~0 main_~i~0)) [2018-11-23 12:23:10,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:10,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:10,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:12,189 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimCell_73 (+ |main_~#a~0.offset| 16)) (* main_~i~0 main_~i~0)) [2018-11-23 12:23:12,190 INFO L303 Elim1Store]: Index analysis took 4316 ms [2018-11-23 12:23:12,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 249 [2018-11-23 12:23:12,196 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:12,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:12,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-23 12:23:12,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:143, output treesize:387 [2018-11-23 12:23:14,453 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:14,454 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_86, |v_#memory_int_64|]. (let ((.cse12 (mod main_~i~0 4294967296))) (let ((.cse9 (+ |main_~#a~0.offset| 16)) (.cse3 (* 8 .cse12)) (.cse4 (* main_~i~0 main_~i~0)) (.cse10 (<= .cse12 2147483647)) (.cse5 (< 4 ~SIZE~0)) (.cse1 (+ |main_~#a~0.offset| 32)) (.cse7 (+ |main_~#a~0.offset| 24)) (.cse6 (<= ~SIZE~0 2147483647)) (.cse2 (+ |main_~#a~0.offset| 8)) (.cse8 (< main_~i~0 ~SIZE~0))) (or (let ((.cse0 (select v_prenex_86 |main_~#a~0.base|))) (and (= (select .cse0 .cse1) 16) (= (select .cse0 .cse2) 1) (= |#memory_int| (store v_prenex_86 |main_~#a~0.base| (store .cse0 (+ .cse3 |main_~#a~0.offset|) .cse4))) .cse5 .cse6 (= 9 (select .cse0 .cse7)) .cse8 (= 4 (select .cse0 .cse9)) .cse10)) (let ((.cse11 (select |v_#memory_int_64| |main_~#a~0.base|))) (and (= 4 (select .cse11 .cse9)) (= (store |v_#memory_int_64| |main_~#a~0.base| (store .cse11 (+ .cse3 |main_~#a~0.offset| (- 34359738368)) .cse4)) |#memory_int|) (not .cse10) .cse5 (= (select .cse11 .cse1) 16) (= 9 (select .cse11 .cse7)) .cse6 (= (select .cse11 .cse2) 1) .cse8))))) [2018-11-23 12:23:14,454 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse17 (mod main_~i~0 4294967296))) (let ((.cse15 (* 8 .cse17))) (let ((.cse13 (+ |main_~#a~0.offset| 32)) (.cse10 (+ |main_~#a~0.offset| 16)) (.cse6 (+ |main_~#a~0.offset| 8)) (.cse11 (+ |main_~#a~0.offset| 24)) (.cse14 (select |#memory_int| |main_~#a~0.base|)) (.cse5 (+ .cse15 |main_~#a~0.offset|)) (.cse16 (* main_~i~0 main_~i~0))) (let ((.cse4 (= (select .cse14 .cse5) .cse16)) (.cse12 (<= .cse17 2147483647)) (.cse1 (= 9 (select .cse14 .cse11))) (.cse0 (< 4 ~SIZE~0)) (.cse9 (= 1 (select .cse14 .cse6))) (.cse2 (<= ~SIZE~0 2147483647)) (.cse3 (< main_~i~0 ~SIZE~0)) (.cse7 (= 4 (select .cse14 .cse10))) (.cse8 (= 16 (select .cse14 .cse13)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 .cse6) .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 (= .cse5 .cse10) .cse8) (and .cse0 .cse9 .cse2 .cse3 .cse4 .cse7 (= .cse11 .cse5) .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 (= .cse13 .cse5) .cse7) (and (not .cse12) .cse1 .cse0 (= (select .cse14 (+ .cse15 |main_~#a~0.offset| (- 34359738368))) .cse16) .cse9 .cse2 .cse3 .cse7 .cse8)))))) [2018-11-23 12:23:14,694 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 12:23:17,581 WARN L180 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2018-11-23 12:23:18,720 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2018-11-23 12:23:18,806 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:23:18,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:18,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2018-11-23 12:23:18,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,845 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:23:18,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:18,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2018-11-23 12:23:18,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:18,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:18,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:18,894 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:133, output treesize:7 [2018-11-23 12:23:18,901 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:18,902 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|, v_prenex_101, v_prenex_100, v_prenex_102]. (let ((.cse5 (mod main_~i~0 4294967296))) (let ((.cse3 (<= .cse5 2147483647)) (.cse1 (* 8 .cse5)) (.cse2 (= main_~i~0 1))) (or (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= 9 (select .cse0 (+ |main_~#a~0.offset| 24))) (= (select .cse0 (+ .cse1 |main_~#a~0.offset|)) |main_#t~mem4|) (= 1 (select .cse0 (+ |main_~#a~0.offset| 8))) .cse2 (= 4 (select .cse0 (+ |main_~#a~0.offset| 16))) (= 0 (select .cse0 |main_~#a~0.offset|)) (= 16 (select .cse0 (+ |main_~#a~0.offset| 32))) .cse3)) (let ((.cse4 (select v_prenex_101 v_prenex_100))) (and (not .cse3) (= (select .cse4 (+ .cse1 v_prenex_102 (- 34359738368))) |main_#t~mem4|) (= 4 (select .cse4 (+ v_prenex_102 16))) (= 1 (select .cse4 (+ v_prenex_102 8))) .cse2 (= 9 (select .cse4 (+ v_prenex_102 24))) (= 16 (select .cse4 (+ v_prenex_102 32))) (= 0 (select .cse4 v_prenex_102))))))) [2018-11-23 12:23:18,902 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~i~0 1) (= 1 |main_#t~mem4|)) [2018-11-23 12:23:18,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {6754#true} call ULTIMATE.init(); {6754#true} is VALID [2018-11-23 12:23:18,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {6754#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {6754#true} is VALID [2018-11-23 12:23:18,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {6754#true} assume true; {6754#true} is VALID [2018-11-23 12:23:18,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6754#true} {6754#true} #56#return; {6754#true} is VALID [2018-11-23 12:23:18,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {6754#true} call #t~ret5 := main(); {6754#true} is VALID [2018-11-23 12:23:18,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {6754#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6774#(<= ~SIZE~0 2147483647)} is VALID [2018-11-23 12:23:18,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {6774#(<= ~SIZE~0 2147483647)} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(8 * ~SIZE~0);~i~0 := 0; {6778#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:18,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {6778#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6778#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:18,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {6778#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6785#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1))} is VALID [2018-11-23 12:23:18,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {6785#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6789#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} is VALID [2018-11-23 12:23:18,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {6789#(and (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6793#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0))} is VALID [2018-11-23 12:23:18,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {6793#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6797#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} is VALID [2018-11-23 12:23:18,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {6797#(and (= main_~i~0 2) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6801#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:23:18,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {6801#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6805#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:23:18,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {6805#(and (= main_~i~0 3) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6809#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 4))} is VALID [2018-11-23 12:23:18,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {6809#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< 1 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6813#(and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:23:18,972 INFO L273 TraceCheckUtils]: 16: Hoare triple {6813#(and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6813#(and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:23:18,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {6813#(and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} assume !!(~i~0 < ~SIZE~0);call write~int(~i~0 * ~i~0, ~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6820#(or (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 32 (* 8 (mod main_~i~0 4294967296)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= (* 8 (mod main_~i~0 4294967296)) 16) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (= 24 (* 8 (mod main_~i~0 4294967296))) (< 4 ~SIZE~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset| (- 34359738368))) (* main_~i~0 main_~i~0)) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (< 2147483647 (mod main_~i~0 4294967296)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (* 8 (mod main_~i~0 4294967296)) 8) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))))} is VALID [2018-11-23 12:23:19,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {6820#(or (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 32 (* 8 (mod main_~i~0 4294967296)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= (* 8 (mod main_~i~0 4294967296)) 16) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (= 24 (* 8 (mod main_~i~0 4294967296))) (< 4 ~SIZE~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset| (- 34359738368))) (* main_~i~0 main_~i~0)) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (< 2147483647 (mod main_~i~0 4294967296)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (<= ~SIZE~0 2147483647) (< main_~i~0 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= (* 8 (mod main_~i~0 4294967296)) 8) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6824#(or (and (< 4 ~SIZE~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (exists ((v_prenex_91 Int)) (and (= (* 8 (mod v_prenex_91 4294967296)) 24) (< v_prenex_91 ~SIZE~0) (<= main_~i~0 (+ v_prenex_91 1)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod v_prenex_91 4294967296)) |main_~#a~0.offset|)) (* v_prenex_91 v_prenex_91)))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (exists ((v_prenex_87 Int)) (and (= (* v_prenex_87 v_prenex_87) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod v_prenex_87 4294967296)) |main_~#a~0.offset|))) (< v_prenex_87 ~SIZE~0) (= (* 8 (mod v_prenex_87 4294967296)) 32) (<= main_~i~0 (+ v_prenex_87 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (<= ~SIZE~0 2147483647) (exists ((v_prenex_89 Int)) (and (= (* v_prenex_89 v_prenex_89) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod v_prenex_89 4294967296)) |main_~#a~0.offset|))) (<= main_~i~0 (+ v_prenex_89 1)) (= (* 8 (mod v_prenex_89 4294967296)) 8) (< v_prenex_89 ~SIZE~0))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (exists ((v_prenex_90 Int)) (and (= (* v_prenex_90 v_prenex_90) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod v_prenex_90 4294967296)) |main_~#a~0.offset|))) (< v_prenex_90 ~SIZE~0) (<= (mod v_prenex_90 4294967296) 2147483647) (<= main_~i~0 (+ v_prenex_90 1))))) (and (exists ((v_prenex_88 Int)) (and (= (* 8 (mod v_prenex_88 4294967296)) 16) (< v_prenex_88 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod v_prenex_88 4294967296)) |main_~#a~0.offset|)) (* v_prenex_88 v_prenex_88)) (<= main_~i~0 (+ v_prenex_88 1)))) (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))))} is UNKNOWN [2018-11-23 12:23:19,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {6824#(or (and (< 4 ~SIZE~0) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (exists ((v_prenex_91 Int)) (and (= (* 8 (mod v_prenex_91 4294967296)) 24) (< v_prenex_91 ~SIZE~0) (<= main_~i~0 (+ v_prenex_91 1)) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod v_prenex_91 4294967296)) |main_~#a~0.offset|)) (* v_prenex_91 v_prenex_91)))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (exists ((v_prenex_87 Int)) (and (= (* v_prenex_87 v_prenex_87) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod v_prenex_87 4294967296)) |main_~#a~0.offset|))) (< v_prenex_87 ~SIZE~0) (= (* 8 (mod v_prenex_87 4294967296)) 32) (<= main_~i~0 (+ v_prenex_87 1)))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (<= ~SIZE~0 2147483647) (exists ((v_prenex_89 Int)) (and (= (* v_prenex_89 v_prenex_89) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod v_prenex_89 4294967296)) |main_~#a~0.offset|))) (<= main_~i~0 (+ v_prenex_89 1)) (= (* 8 (mod v_prenex_89 4294967296)) 8) (< v_prenex_89 ~SIZE~0))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))) (and (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (exists ((v_prenex_90 Int)) (and (= (* v_prenex_90 v_prenex_90) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod v_prenex_90 4294967296)) |main_~#a~0.offset|))) (< v_prenex_90 ~SIZE~0) (<= (mod v_prenex_90 4294967296) 2147483647) (<= main_~i~0 (+ v_prenex_90 1))))) (and (exists ((v_prenex_88 Int)) (and (= (* 8 (mod v_prenex_88 4294967296)) 16) (< v_prenex_88 ~SIZE~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod v_prenex_88 4294967296)) |main_~#a~0.offset|)) (* v_prenex_88 v_prenex_88)) (<= main_~i~0 (+ v_prenex_88 1)))) (< 4 ~SIZE~0) (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= ~SIZE~0 2147483647) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32)))))} assume !(~i~0 < ~SIZE~0); {6828#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:23:19,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {6828#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} ~i~0 := 0; {6832#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:19,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {6832#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6836#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) |main_#t~mem4|) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:19,053 INFO L256 TraceCheckUtils]: 22: Hoare triple {6836#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) |main_#t~mem4|) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {6840#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 16)) 4) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 32))) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 8))) (= 9 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 24)))))} is VALID [2018-11-23 12:23:19,054 INFO L273 TraceCheckUtils]: 23: Hoare triple {6840#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 16)) 4) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 32))) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 8))) (= 9 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 24)))))} ~cond := #in~cond; {6844#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 16)) 4) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 32))) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 8))) (= 9 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 24))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:23:19,055 INFO L273 TraceCheckUtils]: 24: Hoare triple {6844#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 16)) 4) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 32))) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 8))) (= 9 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 24))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {6848#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 16)) 4) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 32))) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 8))) (= 9 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 24))))))} is VALID [2018-11-23 12:23:19,056 INFO L273 TraceCheckUtils]: 25: Hoare triple {6848#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 16)) 4) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 32))) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 8))) (= 9 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 24))))))} assume true; {6848#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 16)) 4) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 32))) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 8))) (= 9 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 24))))))} is VALID [2018-11-23 12:23:19,058 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {6848#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 16)) 4) (= 16 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 32))) (= 1 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 8))) (= 9 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 24))))))} {6836#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) |main_#t~mem4|) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} #60#return; {6855#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:19,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {6855#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} havoc #t~mem4; {6855#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:19,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {6855#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 8 (mod main_~i~0 4294967296)) |main_~#a~0.offset|)) (* main_~i~0 main_~i~0)) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6862#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} is VALID [2018-11-23 12:23:19,062 INFO L273 TraceCheckUtils]: 29: Hoare triple {6862#(and (= 9 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 24))) (= 1 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 1) (= 4 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 16 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 32))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 8 * (if ~i~0 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 else ~i~0 % 4294967296 - 4294967296), 8); {6866#(and (= main_~i~0 1) (= 1 |main_#t~mem4|))} is VALID [2018-11-23 12:23:19,063 INFO L256 TraceCheckUtils]: 30: Hoare triple {6866#(and (= main_~i~0 1) (= 1 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 == ~i~0 * ~i~0 then 1 else 0)); {6870#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:23:19,063 INFO L273 TraceCheckUtils]: 31: Hoare triple {6870#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {6874#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:23:19,064 INFO L273 TraceCheckUtils]: 32: Hoare triple {6874#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6755#false} is VALID [2018-11-23 12:23:19,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {6755#false} assume !false; {6755#false} is VALID [2018-11-23 12:23:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:23:19,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:23:19,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-11-23 12:23:19,092 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-11-23 12:23:19,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:19,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:23:19,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:19,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:23:19,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:23:19,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=522, Unknown=1, NotChecked=0, Total=600 [2018-11-23 12:23:19,203 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 25 states. [2018-11-23 12:23:20,617 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 44 [2018-11-23 12:23:22,222 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 39 [2018-11-23 12:23:23,254 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2018-11-23 12:23:23,540 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2018-11-23 12:23:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:27,994 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-11-23 12:23:27,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:23:27,995 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-11-23 12:23:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:23:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2018-11-23 12:23:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:23:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2018-11-23 12:23:27,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 96 transitions. [2018-11-23 12:23:28,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:28,208 INFO L225 Difference]: With dead ends: 120 [2018-11-23 12:23:28,208 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 12:23:28,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=241, Invalid=1318, Unknown=1, NotChecked=0, Total=1560 [2018-11-23 12:23:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 12:23:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 55. [2018-11-23 12:23:28,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:28,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 55 states. [2018-11-23 12:23:28,467 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 55 states. [2018-11-23 12:23:28,467 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 55 states. [2018-11-23 12:23:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:28,470 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-11-23 12:23:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2018-11-23 12:23:28,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:28,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:28,471 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 118 states. [2018-11-23 12:23:28,471 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 118 states. [2018-11-23 12:23:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:28,474 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-11-23 12:23:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2018-11-23 12:23:28,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:28,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:28,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:28,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:23:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-11-23 12:23:28,476 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2018-11-23 12:23:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:28,476 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-23 12:23:28,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:23:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 12:23:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:23:28,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:28,477 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:28,477 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:28,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:28,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1686741606, now seen corresponding path program 10 times [2018-11-23 12:23:28,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:28,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:28,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:28,483 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:23:28,483 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:23:28,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:23:28,500 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:23:28,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:23:28,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:23:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:28,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:28,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-23 12:23:28,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 12:23:28,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:22 [2018-11-23 12:23:29,510 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 12:23:29,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-23 12:23:29,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 43 [2018-11-23 12:23:29,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:29 [2018-11-23 12:23:29,721 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:23:29,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 12:23:29,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 96 [2018-11-23 12:23:29,789 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,805 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,818 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:97, output treesize:38 [2018-11-23 12:23:29,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-11-23 12:23:29,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:29,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 173 [2018-11-23 12:23:29,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:29,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:47 [2018-11-23 12:23:30,303 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:23:30,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-23 12:23:30,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 274 [2018-11-23 12:23:30,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,434 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:133, output treesize:56 [2018-11-23 12:23:30,697 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:23:30,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2018-11-23 12:23:30,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 399 [2018-11-23 12:23:30,777 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,884 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:151, output treesize:65 [2018-11-23 12:23:31,140 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 12:23:31,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:31,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2018-11-23 12:23:31,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 548 [2018-11-23 12:23:31,269 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:31,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:31,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:31,432 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:169, output treesize:74 [2018-11-23 12:23:31,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 75 [2018-11-23 12:23:31,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,834 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-11-23 12:23:31,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 56 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 721 [2018-11-23 12:23:31,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:32,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:32,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:32,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:187, output treesize:83 [2018-11-23 12:23:32,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 82 [2018-11-23 12:23:32,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,697 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:32,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 72 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 918 [2018-11-23 12:23:32,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:33,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:33,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:33,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:205, output treesize:92 [2018-11-23 12:23:33,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 72 [2018-11-23 12:23:33,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:33,649 INFO L303 Elim1Store]: Index analysis took 119 ms [2018-11-23 12:23:33,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 90 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 1079 [2018-11-23 12:23:33,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:34,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:34,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:34,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92