/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/eqn5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:12,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:12,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:12,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:12,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:12,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:12,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:12,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:12,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:12,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:12,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:12,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:12,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:12,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:12,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:12,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:12,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:12,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:12,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:12,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:12,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:12,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:12,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:12,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:12,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:12,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:12,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:12,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:12,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:12,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:12,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:12,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:12,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:12,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:12,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:12,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:12,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:12,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:12,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:12,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:12,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:12,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:12,649 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:12,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:12,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:12,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:12,651 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:12,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:12,652 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:12,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:12,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:12,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:12,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:12,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:12,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:12,653 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:12,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:12,654 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:12,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:12,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:12,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:12,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:12,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:12,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:12,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:12,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:12,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:12,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:12,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:12,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:12,656 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:12,656 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:12,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:12,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:12,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:12,956 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:12,956 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:12,957 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-10 15:26:13,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e800ece57/e1cf3edee16e43428769d56c1faed671/FLAG0840ae4f4 [2020-07-10 15:26:13,489 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:13,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-10 15:26:13,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e800ece57/e1cf3edee16e43428769d56c1faed671/FLAG0840ae4f4 [2020-07-10 15:26:13,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e800ece57/e1cf3edee16e43428769d56c1faed671 [2020-07-10 15:26:13,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:13,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:13,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:13,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:13,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:13,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:13" (1/1) ... [2020-07-10 15:26:13,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ac12ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:13, skipping insertion in model container [2020-07-10 15:26:13,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:13" (1/1) ... [2020-07-10 15:26:13,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:13,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:14,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:14,159 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:14,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:14,209 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:14,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:14 WrapperNode [2020-07-10 15:26:14,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:14,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:14,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:14,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:14,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:14" (1/1) ... [2020-07-10 15:26:14,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:14" (1/1) ... [2020-07-10 15:26:14,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:14" (1/1) ... [2020-07-10 15:26:14,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:14" (1/1) ... [2020-07-10 15:26:14,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:14" (1/1) ... [2020-07-10 15:26:14,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:14" (1/1) ... [2020-07-10 15:26:14,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:14" (1/1) ... [2020-07-10 15:26:14,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:14,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:14,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:14,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:14,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:14" (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 [2020-07-10 15:26:14,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:14,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:14,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:14,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:14,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:14,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:14,514 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:14,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:15,042 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:15,042 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:26:15,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:15 BoogieIcfgContainer [2020-07-10 15:26:15,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:15,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:15,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:15,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:15,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:13" (1/3) ... [2020-07-10 15:26:15,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d162db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:15, skipping insertion in model container [2020-07-10 15:26:15,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:14" (2/3) ... [2020-07-10 15:26:15,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d162db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:15, skipping insertion in model container [2020-07-10 15:26:15,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:15" (3/3) ... [2020-07-10 15:26:15,056 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn5f.c [2020-07-10 15:26:15,068 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:15,077 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:15,091 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:15,114 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:15,114 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:15,114 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:15,115 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:15,115 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:15,115 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:15,115 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:15,116 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-10 15:26:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:26:15,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:15,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:15,145 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:15,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-10 15:26:15,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:15,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64030650] [2020-07-10 15:26:15,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:15,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {37#true} is VALID [2020-07-10 15:26:15,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-10 15:26:15,421 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-10 15:26:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:15,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-10 15:26:15,436 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-10 15:26:15,436 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-10 15:26:15,436 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-10 15:26:15,439 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:15,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {37#true} is VALID [2020-07-10 15:26:15,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-10 15:26:15,440 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-10 15:26:15,440 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID [2020-07-10 15:26:15,441 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {37#true} is VALID [2020-07-10 15:26:15,441 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(~N~0 <= 0); {37#true} is VALID [2020-07-10 15:26:15,441 INFO L263 TraceCheckUtils]: 7: Hoare triple {37#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {37#true} is VALID [2020-07-10 15:26:15,442 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-10 15:26:15,443 INFO L280 TraceCheckUtils]: 9: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-10 15:26:15,443 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-10 15:26:15,443 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-10 15:26:15,444 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {38#false} is VALID [2020-07-10 15:26:15,444 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-10 15:26:15,445 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} ~i~0 := 1; {38#false} is VALID [2020-07-10 15:26:15,445 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-10 15:26:15,445 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-10 15:26:15,446 INFO L280 TraceCheckUtils]: 17: Hoare triple {38#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {38#false} is VALID [2020-07-10 15:26:15,450 INFO L263 TraceCheckUtils]: 18: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {38#false} is VALID [2020-07-10 15:26:15,451 INFO L280 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2020-07-10 15:26:15,451 INFO L280 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2020-07-10 15:26:15,451 INFO L280 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-10 15:26:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:15,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64030650] [2020-07-10 15:26:15,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:15,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:15,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3510253] [2020-07-10 15:26:15,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:26:15,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:15,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:15,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:15,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:15,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:15,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:15,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:15,538 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-10 15:26:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:15,776 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-10 15:26:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:15,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:26:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-10 15:26:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-10 15:26:15,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2020-07-10 15:26:15,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:15,951 INFO L225 Difference]: With dead ends: 58 [2020-07-10 15:26:15,951 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:26:15,959 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:26:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 15:26:16,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:16,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:16,034 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:16,035 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:16,041 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-10 15:26:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 15:26:16,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:16,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:16,044 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:16,044 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:16,053 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-10 15:26:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 15:26:16,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:16,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:16,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:16,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:26:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-10 15:26:16,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-10 15:26:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:16,063 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-10 15:26:16,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 15:26:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:26:16,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:16,070 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:16,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:16,078 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-10 15:26:16,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:16,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745922242] [2020-07-10 15:26:16,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:16,129 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:16,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841203927] [2020-07-10 15:26:16,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:26:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:16,193 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:26:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:16,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:16,325 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-07-10 15:26:16,325 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 27 treesize of output 15 [2020-07-10 15:26:16,326 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:16,334 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:16,337 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-10 15:26:16,337 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:15 [2020-07-10 15:26:16,344 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:16,345 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|, main_~a~0.base, main_~a~0.offset]. (= (let ((.cse0 (store |v_#memory_int_11| main_~a~0.base (store (select |v_#memory_int_11| main_~a~0.base) main_~a~0.offset 1)))) (store .cse0 main_~b~0.base (store (select .cse0 main_~b~0.base) main_~b~0.offset 1))) |#memory_int|) [2020-07-10 15:26:16,345 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~a~0.base, main_~a~0.offset]. (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) [2020-07-10 15:26:16,436 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:16,437 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-10 15:26:16,439 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-10 15:26:16,454 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-10 15:26:16,455 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:16,455 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-10 15:26:16,458 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:16,459 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~b~0.base, main_~b~0.offset]. (let ((.cse0 (select |#memory_int| main_~b~0.base))) (and (= (select .cse0 main_~b~0.offset) 1) (= (select .cse0 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|) (= 0 main_~i~0))) [2020-07-10 15:26:16,459 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-10 15:26:16,519 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {221#true} is VALID [2020-07-10 15:26:16,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {221#true} is VALID [2020-07-10 15:26:16,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:16,520 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-10 15:26:16,520 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret10 := main(); {221#true} is VALID [2020-07-10 15:26:16,521 INFO L280 TraceCheckUtils]: 5: Hoare triple {221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {221#true} is VALID [2020-07-10 15:26:16,521 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {221#true} is VALID [2020-07-10 15:26:16,522 INFO L263 TraceCheckUtils]: 7: Hoare triple {221#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {221#true} is VALID [2020-07-10 15:26:16,522 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-10 15:26:16,522 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-10 15:26:16,523 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:16,523 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {221#true} #77#return; {221#true} is VALID [2020-07-10 15:26:16,526 INFO L280 TraceCheckUtils]: 12: Hoare triple {221#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-10 15:26:16,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} assume !(~i~0 < ~N~0); {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-10 15:26:16,528 INFO L280 TraceCheckUtils]: 14: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} ~i~0 := 1; {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-10 15:26:16,529 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} assume !(~i~0 < ~N~0); {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-10 15:26:16,530 INFO L280 TraceCheckUtils]: 16: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} ~i~0 := 0; {275#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:26:16,532 INFO L280 TraceCheckUtils]: 17: Hoare triple {275#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {279#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} is VALID [2020-07-10 15:26:16,534 INFO L263 TraceCheckUtils]: 18: Hoare triple {279#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:26:16,535 INFO L280 TraceCheckUtils]: 19: Hoare triple {283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:26:16,537 INFO L280 TraceCheckUtils]: 20: Hoare triple {287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {222#false} is VALID [2020-07-10 15:26:16,537 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-10 15:26:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:16,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745922242] [2020-07-10 15:26:16,540 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:16,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841203927] [2020-07-10 15:26:16,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:16,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:26:16,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291673087] [2020-07-10 15:26:16,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:26:16,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:16,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:26:16,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:16,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:26:16,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:26:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:26:16,580 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-10 15:26:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:17,000 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-10 15:26:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:26:17,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:26:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-10 15:26:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-10 15:26:17,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2020-07-10 15:26:17,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:17,141 INFO L225 Difference]: With dead ends: 47 [2020-07-10 15:26:17,142 INFO L226 Difference]: Without dead ends: 45 [2020-07-10 15:26:17,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:26:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-10 15:26:17,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-10 15:26:17,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:17,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 39 states. [2020-07-10 15:26:17,189 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 39 states. [2020-07-10 15:26:17,190 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 39 states. [2020-07-10 15:26:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:17,196 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-10 15:26:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-10 15:26:17,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:17,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:17,198 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 45 states. [2020-07-10 15:26:17,198 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 45 states. [2020-07-10 15:26:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:17,206 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-10 15:26:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-10 15:26:17,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:17,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:17,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:17,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:26:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-10 15:26:17,221 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-10 15:26:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:17,222 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-10 15:26:17,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:26:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-10 15:26:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:26:17,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:17,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:17,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:26:17,439 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-10 15:26:17,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:17,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272828569] [2020-07-10 15:26:17,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:17,464 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:17,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227867690] [2020-07-10 15:26:17,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:26:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:17,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:26:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:17,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:17,597 INFO L263 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2020-07-10 15:26:17,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {507#true} is VALID [2020-07-10 15:26:17,598 INFO L280 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2020-07-10 15:26:17,598 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #81#return; {507#true} is VALID [2020-07-10 15:26:17,599 INFO L263 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret10 := main(); {507#true} is VALID [2020-07-10 15:26:17,599 INFO L280 TraceCheckUtils]: 5: Hoare triple {507#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {507#true} is VALID [2020-07-10 15:26:17,599 INFO L280 TraceCheckUtils]: 6: Hoare triple {507#true} assume !(~N~0 <= 0); {507#true} is VALID [2020-07-10 15:26:17,600 INFO L263 TraceCheckUtils]: 7: Hoare triple {507#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {507#true} is VALID [2020-07-10 15:26:17,600 INFO L280 TraceCheckUtils]: 8: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2020-07-10 15:26:17,600 INFO L280 TraceCheckUtils]: 9: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2020-07-10 15:26:17,600 INFO L280 TraceCheckUtils]: 10: Hoare triple {507#true} assume true; {507#true} is VALID [2020-07-10 15:26:17,601 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {507#true} {507#true} #77#return; {507#true} is VALID [2020-07-10 15:26:17,602 INFO L280 TraceCheckUtils]: 12: Hoare triple {507#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {548#(<= main_~i~0 1)} is VALID [2020-07-10 15:26:17,604 INFO L280 TraceCheckUtils]: 13: Hoare triple {548#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {552#(<= ~N~0 1)} is VALID [2020-07-10 15:26:17,604 INFO L280 TraceCheckUtils]: 14: Hoare triple {552#(<= ~N~0 1)} ~i~0 := 1; {556#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-10 15:26:17,606 INFO L280 TraceCheckUtils]: 15: Hoare triple {556#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {508#false} is VALID [2020-07-10 15:26:17,606 INFO L280 TraceCheckUtils]: 16: Hoare triple {508#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {508#false} is VALID [2020-07-10 15:26:17,607 INFO L280 TraceCheckUtils]: 17: Hoare triple {508#false} assume !(~i~0 < ~N~0); {508#false} is VALID [2020-07-10 15:26:17,607 INFO L280 TraceCheckUtils]: 18: Hoare triple {508#false} ~i~0 := 0; {508#false} is VALID [2020-07-10 15:26:17,607 INFO L280 TraceCheckUtils]: 19: Hoare triple {508#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {508#false} is VALID [2020-07-10 15:26:17,607 INFO L263 TraceCheckUtils]: 20: Hoare triple {508#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {508#false} is VALID [2020-07-10 15:26:17,608 INFO L280 TraceCheckUtils]: 21: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2020-07-10 15:26:17,608 INFO L280 TraceCheckUtils]: 22: Hoare triple {508#false} assume 0 == ~cond; {508#false} is VALID [2020-07-10 15:26:17,608 INFO L280 TraceCheckUtils]: 23: Hoare triple {508#false} assume !false; {508#false} is VALID [2020-07-10 15:26:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:17,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272828569] [2020-07-10 15:26:17,610 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:17,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227867690] [2020-07-10 15:26:17,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:17,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:17,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702872111] [2020-07-10 15:26:17,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:26:17,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:17,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:17,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:17,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:17,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:17,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:17,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:17,643 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-10 15:26:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:17,889 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-10 15:26:17,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:17,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:26:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-10 15:26:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-10 15:26:17,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2020-07-10 15:26:18,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:18,006 INFO L225 Difference]: With dead ends: 71 [2020-07-10 15:26:18,006 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 15:26:18,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:26:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 15:26:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-10 15:26:18,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:18,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 39 states. [2020-07-10 15:26:18,041 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 39 states. [2020-07-10 15:26:18,041 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 39 states. [2020-07-10 15:26:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:18,045 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-10 15:26:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-10 15:26:18,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:18,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:18,046 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 58 states. [2020-07-10 15:26:18,046 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 58 states. [2020-07-10 15:26:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:18,050 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-10 15:26:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-10 15:26:18,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:18,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:18,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:18,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:26:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-10 15:26:18,054 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-10 15:26:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:18,054 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-10 15:26:18,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-10 15:26:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:26:18,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:18,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:18,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:18,269 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:18,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-10 15:26:18,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:18,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517765806] [2020-07-10 15:26:18,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:18,293 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:18,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817187696] [2020-07-10 15:26:18,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:26:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:18,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:26:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:18,364 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:18,433 INFO L263 TraceCheckUtils]: 0: Hoare triple {856#true} call ULTIMATE.init(); {856#true} is VALID [2020-07-10 15:26:18,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {856#true} is VALID [2020-07-10 15:26:18,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {856#true} assume true; {856#true} is VALID [2020-07-10 15:26:18,434 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {856#true} {856#true} #81#return; {856#true} is VALID [2020-07-10 15:26:18,434 INFO L263 TraceCheckUtils]: 4: Hoare triple {856#true} call #t~ret10 := main(); {856#true} is VALID [2020-07-10 15:26:18,434 INFO L280 TraceCheckUtils]: 5: Hoare triple {856#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {856#true} is VALID [2020-07-10 15:26:18,435 INFO L280 TraceCheckUtils]: 6: Hoare triple {856#true} assume !(~N~0 <= 0); {856#true} is VALID [2020-07-10 15:26:18,435 INFO L263 TraceCheckUtils]: 7: Hoare triple {856#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {856#true} is VALID [2020-07-10 15:26:18,435 INFO L280 TraceCheckUtils]: 8: Hoare triple {856#true} ~cond := #in~cond; {856#true} is VALID [2020-07-10 15:26:18,435 INFO L280 TraceCheckUtils]: 9: Hoare triple {856#true} assume !(0 == ~cond); {856#true} is VALID [2020-07-10 15:26:18,436 INFO L280 TraceCheckUtils]: 10: Hoare triple {856#true} assume true; {856#true} is VALID [2020-07-10 15:26:18,436 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {856#true} {856#true} #77#return; {856#true} is VALID [2020-07-10 15:26:18,438 INFO L280 TraceCheckUtils]: 12: Hoare triple {856#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {897#(<= 1 main_~i~0)} is VALID [2020-07-10 15:26:18,439 INFO L280 TraceCheckUtils]: 13: Hoare triple {897#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {901#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:18,440 INFO L280 TraceCheckUtils]: 14: Hoare triple {901#(<= 2 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {901#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:18,441 INFO L280 TraceCheckUtils]: 15: Hoare triple {901#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {901#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:18,441 INFO L280 TraceCheckUtils]: 16: Hoare triple {901#(<= 2 ~N~0)} ~i~0 := 1; {911#(and (<= 2 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:26:18,442 INFO L280 TraceCheckUtils]: 17: Hoare triple {911#(and (<= 2 ~N~0) (<= main_~i~0 1))} assume !(~i~0 < ~N~0); {857#false} is VALID [2020-07-10 15:26:18,443 INFO L280 TraceCheckUtils]: 18: Hoare triple {857#false} ~i~0 := 0; {857#false} is VALID [2020-07-10 15:26:18,443 INFO L280 TraceCheckUtils]: 19: Hoare triple {857#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {857#false} is VALID [2020-07-10 15:26:18,443 INFO L263 TraceCheckUtils]: 20: Hoare triple {857#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {857#false} is VALID [2020-07-10 15:26:18,444 INFO L280 TraceCheckUtils]: 21: Hoare triple {857#false} ~cond := #in~cond; {857#false} is VALID [2020-07-10 15:26:18,444 INFO L280 TraceCheckUtils]: 22: Hoare triple {857#false} assume 0 == ~cond; {857#false} is VALID [2020-07-10 15:26:18,444 INFO L280 TraceCheckUtils]: 23: Hoare triple {857#false} assume !false; {857#false} is VALID [2020-07-10 15:26:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:18,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517765806] [2020-07-10 15:26:18,446 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:18,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817187696] [2020-07-10 15:26:18,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:18,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-10 15:26:18,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022355945] [2020-07-10 15:26:18,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:26:18,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:18,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:18,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:18,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:18,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:18,476 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2020-07-10 15:26:18,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:18,729 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-10 15:26:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:26:18,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:26:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-10 15:26:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-10 15:26:18,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2020-07-10 15:26:18,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:18,808 INFO L225 Difference]: With dead ends: 66 [2020-07-10 15:26:18,808 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 15:26:18,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:26:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 15:26:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-10 15:26:18,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:18,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 40 states. [2020-07-10 15:26:18,841 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 40 states. [2020-07-10 15:26:18,841 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 40 states. [2020-07-10 15:26:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:18,844 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-10 15:26:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 15:26:18,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:18,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:18,845 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 55 states. [2020-07-10 15:26:18,845 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 55 states. [2020-07-10 15:26:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:18,847 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-10 15:26:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 15:26:18,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:18,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:18,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:18,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:26:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-10 15:26:18,851 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-10 15:26:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:18,851 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-10 15:26:18,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-10 15:26:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:26:18,852 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:18,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:19,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:19,068 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:19,069 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-10 15:26:19,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:19,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542469632] [2020-07-10 15:26:19,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:19,089 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:19,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193458377] [2020-07-10 15:26:19,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:26:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:19,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-10 15:26:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:19,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:19,178 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-10 15:26:19,180 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:19,187 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:19,194 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-10 15:26:19,195 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:19,201 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:19,202 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:19,202 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-10 15:26:19,206 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:19,207 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, |v_#valid_10|]. (and (= (let ((.cse0 (store |v_#memory_int_12| main_~a~0.base (store (select |v_#memory_int_12| main_~a~0.base) main_~a~0.offset 1)))) (store .cse0 main_~b~0.base (store (select .cse0 main_~b~0.base) main_~b~0.offset 1))) |#memory_int|) (<= (select (store |v_#valid_10| main_~a~0.base 1) main_~b~0.base) 0)) [2020-07-10 15:26:19,207 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) [2020-07-10 15:26:19,289 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-10 15:26:19,289 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-10 15:26:19,310 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:19,340 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-10 15:26:19,346 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:19,356 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:26:19,356 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-10 15:26:19,373 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:19,374 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, main_~i~0]. (let ((.cse0 (select |v_#memory_int_13| main_~a~0.base))) (and (= 1 (select .cse0 main_~a~0.offset)) (= 1 (select (select |v_#memory_int_13| main_~b~0.base) main_~b~0.offset)) (= (store |v_#memory_int_13| main_~a~0.base (let ((.cse1 (* main_~i~0 8))) (store .cse0 (+ .cse1 main_~a~0.offset) (+ (select .cse0 (+ .cse1 main_~a~0.offset (- 8))) 10)))) |#memory_int|) (not (= main_~a~0.base main_~b~0.base)))) [2020-07-10 15:26:19,374 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (let ((.cse2 (* main_~i~0 8))) (let ((.cse1 (select |#memory_int| main_~a~0.base)) (.cse0 (+ .cse2 main_~a~0.offset))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (or (= main_~a~0.offset .cse0) (= 1 (select .cse1 main_~a~0.offset))) (= (+ (select .cse1 (+ .cse2 main_~a~0.offset (- 8))) 10) (select .cse1 .cse0)) (not (= main_~a~0.base main_~b~0.base))))) [2020-07-10 15:26:19,377 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:19,422 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:19,481 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:19,524 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:19,623 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-10 15:26:19,623 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:19,652 INFO L440 ElimStorePlain]: Different costs {12=[|v_#memory_int_14|], 20=[v_prenex_3]} [2020-07-10 15:26:19,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:19,668 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-10 15:26:19,668 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2020-07-10 15:26:19,674 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:19,710 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:19,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:19,752 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-10 15:26:19,752 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 85 [2020-07-10 15:26:19,760 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:19,832 INFO L624 ElimStorePlain]: treesize reduction 53, result has 65.6 percent of original size [2020-07-10 15:26:19,840 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-07-10 15:26:19,840 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:101 [2020-07-10 15:26:19,855 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:19,856 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_prenex_3, v_prenex_4, v_prenex_2, v_prenex_1, |v_#memory_int_14|, main_~a~0.base, main_~a~0.offset]. (let ((.cse2 (+ main_~b~0.offset 8))) (or (let ((.cse4 (select |v_#memory_int_14| main_~a~0.base)) (.cse1 (select |v_#memory_int_14| main_~b~0.base))) (let ((.cse0 (select .cse1 main_~b~0.offset)) (.cse3 (select .cse4 main_~a~0.offset))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_14| main_~b~0.base (store .cse1 .cse2 (+ .cse3 .cse0)))) (not (= main_~a~0.base main_~b~0.base)) (= (+ (select .cse4 (+ main_~a~0.offset (- 8))) 10) .cse3)))) (let ((.cse9 (select v_prenex_3 main_~b~0.base)) (.cse6 (select v_prenex_3 v_prenex_4))) (let ((.cse8 (select .cse6 v_prenex_2)) (.cse5 (select .cse9 main_~b~0.offset))) (and (= 1 .cse5) (let ((.cse7 (* v_prenex_1 8))) (= (select .cse6 (+ .cse7 v_prenex_2)) (+ (select .cse6 (+ .cse7 v_prenex_2 (- 8))) 10))) (not (= v_prenex_4 main_~b~0.base)) (= 1 .cse8) (= |#memory_int| (store v_prenex_3 main_~b~0.base (store .cse9 .cse2 (+ .cse8 .cse5))))))))) [2020-07-10 15:26:19,856 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_4, v_prenex_2, v_prenex_1, main_~a~0.base, main_~a~0.offset]. (let ((.cse7 (select |#memory_int| main_~b~0.base))) (let ((.cse0 (= (select .cse7 main_~b~0.offset) 1)) (.cse1 (select .cse7 (+ main_~b~0.offset 8)))) (or (let ((.cse3 (select |#memory_int| main_~a~0.base))) (let ((.cse2 (select .cse3 (+ main_~a~0.offset (- 8))))) (and .cse0 (= .cse1 (+ .cse2 11)) (= (+ .cse2 10) (select .cse3 main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (let ((.cse5 (select |#memory_int| v_prenex_4))) (let ((.cse4 (select .cse5 v_prenex_2))) (and .cse0 (= (+ .cse4 1) .cse1) (let ((.cse6 (* v_prenex_1 8))) (= (+ (select .cse5 (+ v_prenex_2 .cse6 (- 8))) 10) (select .cse5 (+ v_prenex_2 .cse6)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 .cse4))))))) [2020-07-10 15:26:22,468 WARN L193 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-10 15:26:27,603 WARN L193 SmtUtils]: Spent 2.92 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-10 15:26:27,618 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:27,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:27,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:27,688 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:26:27,693 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:26:27,719 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-10 15:26:27,720 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 45 [2020-07-10 15:26:27,732 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:26:27,732 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:27,738 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:27,781 INFO L350 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2020-07-10 15:26:27,782 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 43 [2020-07-10 15:26:27,788 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-07-10 15:26:27,837 INFO L624 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2020-07-10 15:26:27,843 INFO L544 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:27,843 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:7 [2020-07-10 15:26:27,853 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:27,853 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_prenex_4, v_prenex_2, main_~b~0.base, main_~b~0.offset, v_prenex_1, main_~a~0.base, main_~a~0.offset]. (let ((.cse9 (select |#memory_int| main_~b~0.base))) (let ((.cse0 (= (select .cse9 main_~b~0.offset) 1)) (.cse2 (select .cse9 (+ main_~b~0.offset 8))) (.cse5 (= (select .cse9 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|)) (.cse6 (= 0 main_~i~0))) (or (let ((.cse3 (select |#memory_int| v_prenex_4))) (let ((.cse1 (select .cse3 v_prenex_2))) (and .cse0 (= (+ .cse1 1) .cse2) (let ((.cse4 (* v_prenex_1 8))) (= (+ (select .cse3 (+ v_prenex_2 .cse4 (- 8))) 10) (select .cse3 (+ v_prenex_2 .cse4)))) .cse5 (not (= v_prenex_4 main_~b~0.base)) .cse6 (= 1 .cse1)))) (let ((.cse8 (select |#memory_int| main_~a~0.base))) (let ((.cse7 (select .cse8 (+ main_~a~0.offset (- 8))))) (and .cse0 (= .cse2 (+ .cse7 11)) .cse5 (= (+ .cse7 10) (select .cse8 main_~a~0.offset)) .cse6 (not (= main_~a~0.base main_~b~0.base)))))))) [2020-07-10 15:26:27,854 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-10 15:26:27,949 INFO L263 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2020-07-10 15:26:27,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1194#true} is VALID [2020-07-10 15:26:27,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2020-07-10 15:26:27,951 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #81#return; {1194#true} is VALID [2020-07-10 15:26:27,951 INFO L263 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret10 := main(); {1194#true} is VALID [2020-07-10 15:26:27,951 INFO L280 TraceCheckUtils]: 5: Hoare triple {1194#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1194#true} is VALID [2020-07-10 15:26:27,952 INFO L280 TraceCheckUtils]: 6: Hoare triple {1194#true} assume !(~N~0 <= 0); {1194#true} is VALID [2020-07-10 15:26:27,952 INFO L263 TraceCheckUtils]: 7: Hoare triple {1194#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1194#true} is VALID [2020-07-10 15:26:27,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {1194#true} ~cond := #in~cond; {1194#true} is VALID [2020-07-10 15:26:27,953 INFO L280 TraceCheckUtils]: 9: Hoare triple {1194#true} assume !(0 == ~cond); {1194#true} is VALID [2020-07-10 15:26:27,953 INFO L280 TraceCheckUtils]: 10: Hoare triple {1194#true} assume true; {1194#true} is VALID [2020-07-10 15:26:27,953 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1194#true} {1194#true} #77#return; {1194#true} is VALID [2020-07-10 15:26:27,957 INFO L280 TraceCheckUtils]: 12: Hoare triple {1194#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {1235#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-10 15:26:27,962 INFO L280 TraceCheckUtils]: 13: Hoare triple {1235#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-10 15:26:27,969 INFO L280 TraceCheckUtils]: 14: Hoare triple {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-10 15:26:27,974 INFO L280 TraceCheckUtils]: 15: Hoare triple {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} assume !(~i~0 < ~N~0); {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-10 15:26:27,979 INFO L280 TraceCheckUtils]: 16: Hoare triple {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} ~i~0 := 1; {1249#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (exists ((v_prenex_1 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset)))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-10 15:26:30,013 INFO L280 TraceCheckUtils]: 17: Hoare triple {1249#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (exists ((v_prenex_1 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset)))) (not (= main_~a~0.base main_~b~0.base))))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} is UNKNOWN [2020-07-10 15:26:30,015 INFO L280 TraceCheckUtils]: 18: Hoare triple {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} is VALID [2020-07-10 15:26:30,016 INFO L280 TraceCheckUtils]: 19: Hoare triple {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} assume !(~i~0 < ~N~0); {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} is VALID [2020-07-10 15:26:30,018 INFO L280 TraceCheckUtils]: 20: Hoare triple {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} ~i~0 := 0; {1263#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2)))) (= 0 main_~i~0)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))))} is VALID [2020-07-10 15:26:30,022 INFO L280 TraceCheckUtils]: 21: Hoare triple {1263#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2)))) (= 0 main_~i~0)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1267#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} is VALID [2020-07-10 15:26:30,031 INFO L263 TraceCheckUtils]: 22: Hoare triple {1267#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {1271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:26:30,036 INFO L280 TraceCheckUtils]: 23: Hoare triple {1271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:26:30,037 INFO L280 TraceCheckUtils]: 24: Hoare triple {1275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1195#false} is VALID [2020-07-10 15:26:30,038 INFO L280 TraceCheckUtils]: 25: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2020-07-10 15:26:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:30,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542469632] [2020-07-10 15:26:30,045 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:30,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193458377] [2020-07-10 15:26:30,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:30,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-10 15:26:30,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370700627] [2020-07-10 15:26:30,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 15:26:30,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:30,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:26:32,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:32,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:26:32,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:32,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:26:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=71, Unknown=1, NotChecked=0, Total=90 [2020-07-10 15:26:32,160 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2020-07-10 15:26:50,770 WARN L193 SmtUtils]: Spent 8.79 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-07-10 15:27:00,434 WARN L193 SmtUtils]: Spent 8.97 s on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-07-10 15:27:22,232 WARN L193 SmtUtils]: Spent 21.38 s on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2020-07-10 15:27:35,878 WARN L193 SmtUtils]: Spent 10.67 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2020-07-10 15:27:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:43,198 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-07-10 15:27:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:27:43,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 15:27:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:27:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2020-07-10 15:27:43,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:27:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2020-07-10 15:27:43,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2020-07-10 15:27:49,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 67 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:49,768 INFO L225 Difference]: With dead ends: 69 [2020-07-10 15:27:49,769 INFO L226 Difference]: Without dead ends: 67 [2020-07-10 15:27:49,769 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 63.1s TimeCoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2020-07-10 15:27:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-10 15:27:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2020-07-10 15:27:49,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:49,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 46 states. [2020-07-10 15:27:49,863 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 46 states. [2020-07-10 15:27:49,863 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 46 states. [2020-07-10 15:27:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,866 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-10 15:27:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-10 15:27:49,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:49,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:49,867 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 67 states. [2020-07-10 15:27:49,867 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 67 states. [2020-07-10 15:27:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,871 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-10 15:27:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-10 15:27:49,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:49,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:49,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:49,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:27:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2020-07-10 15:27:49,874 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 26 [2020-07-10 15:27:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:49,876 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-07-10 15:27:49,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:27:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2020-07-10 15:27:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:49,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:49,877 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:50,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:50,079 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:50,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:50,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1499578309, now seen corresponding path program 2 times [2020-07-10 15:27:50,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:50,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323735078] [2020-07-10 15:27:50,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {1603#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1589#true} is VALID [2020-07-10 15:27:50,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:50,338 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1589#true} {1589#true} #81#return; {1589#true} is VALID [2020-07-10 15:27:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {1589#true} ~cond := #in~cond; {1589#true} is VALID [2020-07-10 15:27:50,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {1589#true} assume !(0 == ~cond); {1589#true} is VALID [2020-07-10 15:27:50,354 INFO L280 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:50,354 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #77#return; {1589#true} is VALID [2020-07-10 15:27:50,356 INFO L263 TraceCheckUtils]: 0: Hoare triple {1589#true} call ULTIMATE.init(); {1603#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:50,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {1603#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1589#true} is VALID [2020-07-10 15:27:50,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:50,357 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #81#return; {1589#true} is VALID [2020-07-10 15:27:50,357 INFO L263 TraceCheckUtils]: 4: Hoare triple {1589#true} call #t~ret10 := main(); {1589#true} is VALID [2020-07-10 15:27:50,357 INFO L280 TraceCheckUtils]: 5: Hoare triple {1589#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1589#true} is VALID [2020-07-10 15:27:50,357 INFO L280 TraceCheckUtils]: 6: Hoare triple {1589#true} assume !(~N~0 <= 0); {1589#true} is VALID [2020-07-10 15:27:50,357 INFO L263 TraceCheckUtils]: 7: Hoare triple {1589#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1589#true} is VALID [2020-07-10 15:27:50,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {1589#true} ~cond := #in~cond; {1589#true} is VALID [2020-07-10 15:27:50,358 INFO L280 TraceCheckUtils]: 9: Hoare triple {1589#true} assume !(0 == ~cond); {1589#true} is VALID [2020-07-10 15:27:50,358 INFO L280 TraceCheckUtils]: 10: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:50,358 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1589#true} {1589#true} #77#return; {1589#true} is VALID [2020-07-10 15:27:50,360 INFO L280 TraceCheckUtils]: 12: Hoare triple {1589#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {1598#(= 1 main_~i~0)} is VALID [2020-07-10 15:27:50,361 INFO L280 TraceCheckUtils]: 13: Hoare triple {1598#(= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {1598#(= 1 main_~i~0)} is VALID [2020-07-10 15:27:50,362 INFO L280 TraceCheckUtils]: 14: Hoare triple {1598#(= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1599#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:50,364 INFO L280 TraceCheckUtils]: 15: Hoare triple {1599#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {1600#(<= ~N~0 2)} is VALID [2020-07-10 15:27:50,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {1600#(<= ~N~0 2)} ~i~0 := 1; {1601#(and (<= ~N~0 2) (= 1 main_~i~0))} is VALID [2020-07-10 15:27:50,368 INFO L280 TraceCheckUtils]: 17: Hoare triple {1601#(and (<= ~N~0 2) (= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1601#(and (<= ~N~0 2) (= 1 main_~i~0))} is VALID [2020-07-10 15:27:50,369 INFO L280 TraceCheckUtils]: 18: Hoare triple {1601#(and (<= ~N~0 2) (= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1602#(<= ~N~0 main_~i~0)} is VALID [2020-07-10 15:27:50,371 INFO L280 TraceCheckUtils]: 19: Hoare triple {1602#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1590#false} is VALID [2020-07-10 15:27:50,371 INFO L280 TraceCheckUtils]: 20: Hoare triple {1590#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1590#false} is VALID [2020-07-10 15:27:50,372 INFO L280 TraceCheckUtils]: 21: Hoare triple {1590#false} assume !(~i~0 < ~N~0); {1590#false} is VALID [2020-07-10 15:27:50,372 INFO L280 TraceCheckUtils]: 22: Hoare triple {1590#false} ~i~0 := 0; {1590#false} is VALID [2020-07-10 15:27:50,372 INFO L280 TraceCheckUtils]: 23: Hoare triple {1590#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1590#false} is VALID [2020-07-10 15:27:50,372 INFO L263 TraceCheckUtils]: 24: Hoare triple {1590#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {1590#false} is VALID [2020-07-10 15:27:50,373 INFO L280 TraceCheckUtils]: 25: Hoare triple {1590#false} ~cond := #in~cond; {1590#false} is VALID [2020-07-10 15:27:50,373 INFO L280 TraceCheckUtils]: 26: Hoare triple {1590#false} assume 0 == ~cond; {1590#false} is VALID [2020-07-10 15:27:50,373 INFO L280 TraceCheckUtils]: 27: Hoare triple {1590#false} assume !false; {1590#false} is VALID [2020-07-10 15:27:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:50,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323735078] [2020-07-10 15:27:50,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727081757] [2020-07-10 15:27:50,375 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-07-10 15:27:50,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:50,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:50,424 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:50,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:50,592 INFO L263 TraceCheckUtils]: 0: Hoare triple {1589#true} call ULTIMATE.init(); {1589#true} is VALID [2020-07-10 15:27:50,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {1589#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1589#true} is VALID [2020-07-10 15:27:50,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:50,593 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #81#return; {1589#true} is VALID [2020-07-10 15:27:50,593 INFO L263 TraceCheckUtils]: 4: Hoare triple {1589#true} call #t~ret10 := main(); {1589#true} is VALID [2020-07-10 15:27:50,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {1589#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1589#true} is VALID [2020-07-10 15:27:50,593 INFO L280 TraceCheckUtils]: 6: Hoare triple {1589#true} assume !(~N~0 <= 0); {1589#true} is VALID [2020-07-10 15:27:50,594 INFO L263 TraceCheckUtils]: 7: Hoare triple {1589#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1589#true} is VALID [2020-07-10 15:27:50,594 INFO L280 TraceCheckUtils]: 8: Hoare triple {1589#true} ~cond := #in~cond; {1589#true} is VALID [2020-07-10 15:27:50,594 INFO L280 TraceCheckUtils]: 9: Hoare triple {1589#true} assume !(0 == ~cond); {1589#true} is VALID [2020-07-10 15:27:50,594 INFO L280 TraceCheckUtils]: 10: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:50,595 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1589#true} {1589#true} #77#return; {1589#true} is VALID [2020-07-10 15:27:50,596 INFO L280 TraceCheckUtils]: 12: Hoare triple {1589#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {1643#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:50,597 INFO L280 TraceCheckUtils]: 13: Hoare triple {1643#(<= main_~i~0 1)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {1643#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:50,601 INFO L280 TraceCheckUtils]: 14: Hoare triple {1643#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1599#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:50,603 INFO L280 TraceCheckUtils]: 15: Hoare triple {1599#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {1600#(<= ~N~0 2)} is VALID [2020-07-10 15:27:50,604 INFO L280 TraceCheckUtils]: 16: Hoare triple {1600#(<= ~N~0 2)} ~i~0 := 1; {1656#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-10 15:27:50,606 INFO L280 TraceCheckUtils]: 17: Hoare triple {1656#(and (<= ~N~0 2) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1656#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-10 15:27:50,609 INFO L280 TraceCheckUtils]: 18: Hoare triple {1656#(and (<= ~N~0 2) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1663#(and (<= ~N~0 2) (<= 2 main_~i~0))} is VALID [2020-07-10 15:27:50,612 INFO L280 TraceCheckUtils]: 19: Hoare triple {1663#(and (<= ~N~0 2) (<= 2 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1590#false} is VALID [2020-07-10 15:27:50,612 INFO L280 TraceCheckUtils]: 20: Hoare triple {1590#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1590#false} is VALID [2020-07-10 15:27:50,612 INFO L280 TraceCheckUtils]: 21: Hoare triple {1590#false} assume !(~i~0 < ~N~0); {1590#false} is VALID [2020-07-10 15:27:50,612 INFO L280 TraceCheckUtils]: 22: Hoare triple {1590#false} ~i~0 := 0; {1590#false} is VALID [2020-07-10 15:27:50,612 INFO L280 TraceCheckUtils]: 23: Hoare triple {1590#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1590#false} is VALID [2020-07-10 15:27:50,613 INFO L263 TraceCheckUtils]: 24: Hoare triple {1590#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {1590#false} is VALID [2020-07-10 15:27:50,613 INFO L280 TraceCheckUtils]: 25: Hoare triple {1590#false} ~cond := #in~cond; {1590#false} is VALID [2020-07-10 15:27:50,613 INFO L280 TraceCheckUtils]: 26: Hoare triple {1590#false} assume 0 == ~cond; {1590#false} is VALID [2020-07-10 15:27:50,613 INFO L280 TraceCheckUtils]: 27: Hoare triple {1590#false} assume !false; {1590#false} is VALID [2020-07-10 15:27:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:50,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:50,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 15:27:50,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123968084] [2020-07-10 15:27:50,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:50,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:50,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:27:50,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:50,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:27:50,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:50,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:27:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:50,716 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 11 states. [2020-07-10 15:27:52,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:52,373 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-07-10 15:27:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 15:27:52,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2020-07-10 15:27:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2020-07-10 15:27:52,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 87 transitions. [2020-07-10 15:27:52,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:52,644 INFO L225 Difference]: With dead ends: 84 [2020-07-10 15:27:52,645 INFO L226 Difference]: Without dead ends: 71 [2020-07-10 15:27:52,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:27:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-10 15:27:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2020-07-10 15:27:52,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:52,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 45 states. [2020-07-10 15:27:52,754 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 45 states. [2020-07-10 15:27:52,754 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 45 states. [2020-07-10 15:27:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:52,758 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-10 15:27:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-10 15:27:52,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:52,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:52,759 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 71 states. [2020-07-10 15:27:52,759 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 71 states. [2020-07-10 15:27:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:52,762 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-10 15:27:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-10 15:27:52,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:52,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:52,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:52,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 15:27:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-10 15:27:52,765 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 28 [2020-07-10 15:27:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:52,765 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-10 15:27:52,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:27:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-10 15:27:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:52,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:52,766 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:52,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-10 15:27:52,979 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:52,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1048027141, now seen corresponding path program 3 times [2020-07-10 15:27:52,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:52,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595314493] [2020-07-10 15:27:52,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:53,172 INFO L280 TraceCheckUtils]: 0: Hoare triple {2040#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2026#true} is VALID [2020-07-10 15:27:53,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:53,173 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2026#true} {2026#true} #81#return; {2026#true} is VALID [2020-07-10 15:27:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:53,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2020-07-10 15:27:53,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2020-07-10 15:27:53,180 INFO L280 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:53,180 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #77#return; {2026#true} is VALID [2020-07-10 15:27:53,182 INFO L263 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2040#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:53,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {2040#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2026#true} is VALID [2020-07-10 15:27:53,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:53,183 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #81#return; {2026#true} is VALID [2020-07-10 15:27:53,183 INFO L263 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret10 := main(); {2026#true} is VALID [2020-07-10 15:27:53,183 INFO L280 TraceCheckUtils]: 5: Hoare triple {2026#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2026#true} is VALID [2020-07-10 15:27:53,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {2026#true} assume !(~N~0 <= 0); {2026#true} is VALID [2020-07-10 15:27:53,183 INFO L263 TraceCheckUtils]: 7: Hoare triple {2026#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2026#true} is VALID [2020-07-10 15:27:53,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2020-07-10 15:27:53,184 INFO L280 TraceCheckUtils]: 9: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2020-07-10 15:27:53,184 INFO L280 TraceCheckUtils]: 10: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:53,184 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2026#true} {2026#true} #77#return; {2026#true} is VALID [2020-07-10 15:27:53,186 INFO L280 TraceCheckUtils]: 12: Hoare triple {2026#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {2035#(= 1 main_~i~0)} is VALID [2020-07-10 15:27:53,187 INFO L280 TraceCheckUtils]: 13: Hoare triple {2035#(= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2035#(= 1 main_~i~0)} is VALID [2020-07-10 15:27:53,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {2035#(= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2036#(<= 2 main_~i~0)} is VALID [2020-07-10 15:27:53,194 INFO L280 TraceCheckUtils]: 15: Hoare triple {2036#(<= 2 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2037#(<= 3 ~N~0)} is VALID [2020-07-10 15:27:53,195 INFO L280 TraceCheckUtils]: 16: Hoare triple {2037#(<= 3 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2037#(<= 3 ~N~0)} is VALID [2020-07-10 15:27:53,196 INFO L280 TraceCheckUtils]: 17: Hoare triple {2037#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {2037#(<= 3 ~N~0)} is VALID [2020-07-10 15:27:53,198 INFO L280 TraceCheckUtils]: 18: Hoare triple {2037#(<= 3 ~N~0)} ~i~0 := 1; {2038#(and (<= 3 ~N~0) (= 1 main_~i~0))} is VALID [2020-07-10 15:27:53,203 INFO L280 TraceCheckUtils]: 19: Hoare triple {2038#(and (<= 3 ~N~0) (= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {2038#(and (<= 3 ~N~0) (= 1 main_~i~0))} is VALID [2020-07-10 15:27:53,204 INFO L280 TraceCheckUtils]: 20: Hoare triple {2038#(and (<= 3 ~N~0) (= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2039#(<= (+ main_~i~0 1) ~N~0)} is VALID [2020-07-10 15:27:53,212 INFO L280 TraceCheckUtils]: 21: Hoare triple {2039#(<= (+ main_~i~0 1) ~N~0)} assume !(~i~0 < ~N~0); {2027#false} is VALID [2020-07-10 15:27:53,213 INFO L280 TraceCheckUtils]: 22: Hoare triple {2027#false} ~i~0 := 0; {2027#false} is VALID [2020-07-10 15:27:53,213 INFO L280 TraceCheckUtils]: 23: Hoare triple {2027#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2027#false} is VALID [2020-07-10 15:27:53,213 INFO L263 TraceCheckUtils]: 24: Hoare triple {2027#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {2027#false} is VALID [2020-07-10 15:27:53,213 INFO L280 TraceCheckUtils]: 25: Hoare triple {2027#false} ~cond := #in~cond; {2027#false} is VALID [2020-07-10 15:27:53,214 INFO L280 TraceCheckUtils]: 26: Hoare triple {2027#false} assume 0 == ~cond; {2027#false} is VALID [2020-07-10 15:27:53,214 INFO L280 TraceCheckUtils]: 27: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2020-07-10 15:27:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:53,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595314493] [2020-07-10 15:27:53,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239570243] [2020-07-10 15:27:53,217 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-07-10 15:27:53,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:27:53,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:53,261 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:53,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:53,477 INFO L263 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2020-07-10 15:27:53,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {2026#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2026#true} is VALID [2020-07-10 15:27:53,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:53,478 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #81#return; {2026#true} is VALID [2020-07-10 15:27:53,478 INFO L263 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret10 := main(); {2026#true} is VALID [2020-07-10 15:27:53,478 INFO L280 TraceCheckUtils]: 5: Hoare triple {2026#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2026#true} is VALID [2020-07-10 15:27:53,479 INFO L280 TraceCheckUtils]: 6: Hoare triple {2026#true} assume !(~N~0 <= 0); {2026#true} is VALID [2020-07-10 15:27:53,479 INFO L263 TraceCheckUtils]: 7: Hoare triple {2026#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2026#true} is VALID [2020-07-10 15:27:53,479 INFO L280 TraceCheckUtils]: 8: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2020-07-10 15:27:53,479 INFO L280 TraceCheckUtils]: 9: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2020-07-10 15:27:53,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:53,480 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2026#true} {2026#true} #77#return; {2026#true} is VALID [2020-07-10 15:27:53,483 INFO L280 TraceCheckUtils]: 12: Hoare triple {2026#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {2080#(<= 1 main_~i~0)} is VALID [2020-07-10 15:27:53,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {2080#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2080#(<= 1 main_~i~0)} is VALID [2020-07-10 15:27:53,490 INFO L280 TraceCheckUtils]: 14: Hoare triple {2080#(<= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2036#(<= 2 main_~i~0)} is VALID [2020-07-10 15:27:53,497 INFO L280 TraceCheckUtils]: 15: Hoare triple {2036#(<= 2 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2037#(<= 3 ~N~0)} is VALID [2020-07-10 15:27:53,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {2037#(<= 3 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2037#(<= 3 ~N~0)} is VALID [2020-07-10 15:27:53,500 INFO L280 TraceCheckUtils]: 17: Hoare triple {2037#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {2037#(<= 3 ~N~0)} is VALID [2020-07-10 15:27:53,501 INFO L280 TraceCheckUtils]: 18: Hoare triple {2037#(<= 3 ~N~0)} ~i~0 := 1; {2099#(and (<= 3 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:27:53,502 INFO L280 TraceCheckUtils]: 19: Hoare triple {2099#(and (<= 3 ~N~0) (<= main_~i~0 1))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {2099#(and (<= 3 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:27:53,508 INFO L280 TraceCheckUtils]: 20: Hoare triple {2099#(and (<= 3 ~N~0) (<= main_~i~0 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2106#(and (<= 3 ~N~0) (<= main_~i~0 2))} is VALID [2020-07-10 15:27:53,509 INFO L280 TraceCheckUtils]: 21: Hoare triple {2106#(and (<= 3 ~N~0) (<= main_~i~0 2))} assume !(~i~0 < ~N~0); {2027#false} is VALID [2020-07-10 15:27:53,510 INFO L280 TraceCheckUtils]: 22: Hoare triple {2027#false} ~i~0 := 0; {2027#false} is VALID [2020-07-10 15:27:53,510 INFO L280 TraceCheckUtils]: 23: Hoare triple {2027#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2027#false} is VALID [2020-07-10 15:27:53,510 INFO L263 TraceCheckUtils]: 24: Hoare triple {2027#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {2027#false} is VALID [2020-07-10 15:27:53,510 INFO L280 TraceCheckUtils]: 25: Hoare triple {2027#false} ~cond := #in~cond; {2027#false} is VALID [2020-07-10 15:27:53,510 INFO L280 TraceCheckUtils]: 26: Hoare triple {2027#false} assume 0 == ~cond; {2027#false} is VALID [2020-07-10 15:27:53,511 INFO L280 TraceCheckUtils]: 27: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2020-07-10 15:27:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:53,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:53,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 15:27:53,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650222639] [2020-07-10 15:27:53,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:53,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:53,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:27:53,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:53,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:27:53,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:53,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:27:53,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:53,605 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 11 states. [2020-07-10 15:27:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:56,012 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-07-10 15:27:56,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:27:56,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2020-07-10 15:27:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2020-07-10 15:27:56,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2020-07-10 15:27:56,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:56,265 INFO L225 Difference]: With dead ends: 79 [2020-07-10 15:27:56,265 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 15:27:56,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:27:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 15:27:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-07-10 15:27:56,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:56,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 47 states. [2020-07-10 15:27:56,371 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 47 states. [2020-07-10 15:27:56,371 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 47 states. [2020-07-10 15:27:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:56,374 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-10 15:27:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-07-10 15:27:56,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:56,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:56,375 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 68 states. [2020-07-10 15:27:56,375 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 68 states. [2020-07-10 15:27:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:56,378 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-10 15:27:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-07-10 15:27:56,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:56,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:56,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:56,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 15:27:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-10 15:27:56,382 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 28 [2020-07-10 15:27:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:56,382 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-10 15:27:56,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:27:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-10 15:27:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:27:56,383 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:56,383 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:56,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:56,597 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:56,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-10 15:27:56,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:56,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039842216] [2020-07-10 15:27:56,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:56,612 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:56,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908719394] [2020-07-10 15:27:56,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:27:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:56,649 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:27:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:56,661 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:56,837 INFO L263 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2020-07-10 15:27:56,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {2452#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2452#true} is VALID [2020-07-10 15:27:56,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2020-07-10 15:27:56,838 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #81#return; {2452#true} is VALID [2020-07-10 15:27:56,838 INFO L263 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret10 := main(); {2452#true} is VALID [2020-07-10 15:27:56,839 INFO L280 TraceCheckUtils]: 5: Hoare triple {2452#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2452#true} is VALID [2020-07-10 15:27:56,839 INFO L280 TraceCheckUtils]: 6: Hoare triple {2452#true} assume !(~N~0 <= 0); {2452#true} is VALID [2020-07-10 15:27:56,839 INFO L263 TraceCheckUtils]: 7: Hoare triple {2452#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2452#true} is VALID [2020-07-10 15:27:56,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2020-07-10 15:27:56,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2020-07-10 15:27:56,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {2452#true} assume true; {2452#true} is VALID [2020-07-10 15:27:56,840 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2452#true} {2452#true} #77#return; {2452#true} is VALID [2020-07-10 15:27:56,844 INFO L280 TraceCheckUtils]: 12: Hoare triple {2452#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {2493#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:56,846 INFO L280 TraceCheckUtils]: 13: Hoare triple {2493#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:56,847 INFO L280 TraceCheckUtils]: 14: Hoare triple {2497#(<= ~N~0 1)} ~i~0 := 1; {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:56,848 INFO L280 TraceCheckUtils]: 15: Hoare triple {2497#(<= ~N~0 1)} assume !(~i~0 < ~N~0); {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:56,850 INFO L280 TraceCheckUtils]: 16: Hoare triple {2497#(<= ~N~0 1)} ~i~0 := 0; {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:56,854 INFO L280 TraceCheckUtils]: 17: Hoare triple {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:56,857 INFO L263 TraceCheckUtils]: 18: Hoare triple {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:56,858 INFO L280 TraceCheckUtils]: 19: Hoare triple {2497#(<= ~N~0 1)} ~cond := #in~cond; {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:56,860 INFO L280 TraceCheckUtils]: 20: Hoare triple {2497#(<= ~N~0 1)} assume !(0 == ~cond); {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:56,861 INFO L280 TraceCheckUtils]: 21: Hoare triple {2497#(<= ~N~0 1)} assume true; {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:56,863 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2497#(<= ~N~0 1)} {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} #79#return; {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:56,865 INFO L280 TraceCheckUtils]: 23: Hoare triple {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} havoc #t~mem9; {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:56,870 INFO L280 TraceCheckUtils]: 24: Hoare triple {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2532#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-10 15:27:56,872 INFO L280 TraceCheckUtils]: 25: Hoare triple {2532#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2453#false} is VALID [2020-07-10 15:27:56,872 INFO L263 TraceCheckUtils]: 26: Hoare triple {2453#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {2453#false} is VALID [2020-07-10 15:27:56,872 INFO L280 TraceCheckUtils]: 27: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2020-07-10 15:27:56,873 INFO L280 TraceCheckUtils]: 28: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2020-07-10 15:27:56,873 INFO L280 TraceCheckUtils]: 29: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2020-07-10 15:27:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:56,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039842216] [2020-07-10 15:27:56,874 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:56,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908719394] [2020-07-10 15:27:56,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:56,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:27:56,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60080361] [2020-07-10 15:27:56,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 15:27:56,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:56,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:27:56,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:56,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:27:56,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:27:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:56,964 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2020-07-10 15:27:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:57,588 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-10 15:27:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:27:57,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 15:27:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-10 15:27:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-10 15:27:57,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2020-07-10 15:27:57,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:57,757 INFO L225 Difference]: With dead ends: 72 [2020-07-10 15:27:57,757 INFO L226 Difference]: Without dead ends: 50 [2020-07-10 15:27:57,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:27:57,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-10 15:27:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2020-07-10 15:27:57,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:57,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 46 states. [2020-07-10 15:27:57,877 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 46 states. [2020-07-10 15:27:57,877 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 46 states. [2020-07-10 15:27:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:57,880 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-10 15:27:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-10 15:27:57,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:57,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:57,880 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 50 states. [2020-07-10 15:27:57,881 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 50 states. [2020-07-10 15:27:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:57,883 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-10 15:27:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-10 15:27:57,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:57,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:57,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:57,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:27:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-07-10 15:27:57,886 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 30 [2020-07-10 15:27:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:57,886 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-07-10 15:27:57,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:27:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-07-10 15:27:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:27:57,887 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:57,887 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:58,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:58,102 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 4 times [2020-07-10 15:27:58,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:58,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80126967] [2020-07-10 15:27:58,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:58,131 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:58,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [214282431] [2020-07-10 15:27:58,132 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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 [2020-07-10 15:27:58,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:27:58,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:58,186 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-10 15:27:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:58,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:58,251 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-10 15:27:58,252 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:58,262 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:58,276 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-10 15:27:58,276 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:58,295 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:58,296 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:27:58,296 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-10 15:27:58,305 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:58,305 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, |v_#valid_11|]. (and (= 0 (select (store |v_#valid_11| main_~a~0.base 1) main_~b~0.base)) (= (let ((.cse0 (store |v_#memory_int_15| main_~a~0.base (store (select |v_#memory_int_15| main_~a~0.base) main_~a~0.offset 1)))) (store .cse0 main_~b~0.base (store (select .cse0 main_~b~0.base) main_~b~0.offset 1))) |#memory_int|)) [2020-07-10 15:27:58,305 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) [2020-07-10 15:27:58,494 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2020-07-10 15:27:58,495 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-10 15:27:58,496 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-10 15:27:58,502 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:58,609 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-07-10 15:27:58,610 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-10 15:27:58,615 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:58,630 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:27:58,630 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-10 15:27:58,774 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:58,774 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, main_~i~0]. (let ((.cse0 (select |v_#memory_int_16| main_~a~0.base))) (and (= 1 (select (select |v_#memory_int_16| main_~b~0.base) main_~b~0.offset)) (= 1 (select .cse0 main_~a~0.offset)) (= |#memory_int| (store |v_#memory_int_16| main_~a~0.base (let ((.cse1 (* main_~i~0 8))) (store .cse0 (+ .cse1 main_~a~0.offset) (+ (select .cse0 (+ .cse1 main_~a~0.offset (- 8))) 10))))) (not (= main_~a~0.base main_~b~0.base)))) [2020-07-10 15:27:58,774 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (let ((.cse2 (* main_~i~0 8))) (let ((.cse1 (select |#memory_int| main_~a~0.base)) (.cse0 (+ .cse2 main_~a~0.offset))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (or (= main_~a~0.offset .cse0) (= 1 (select .cse1 main_~a~0.offset))) (= (+ (select .cse1 (+ .cse2 main_~a~0.offset (- 8))) 10) (select .cse1 .cse0)) (not (= main_~a~0.base main_~b~0.base))))) [2020-07-10 15:27:58,783 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:58,893 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:58,979 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:58,986 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:59,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:59,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:59,181 INFO L244 Elim1Store]: Index analysis took 119 ms [2020-07-10 15:27:59,621 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-10 15:27:59,622 INFO L350 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2020-07-10 15:27:59,622 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 252 [2020-07-10 15:27:59,643 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-10 15:27:59,644 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:27:59,663 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-10 15:27:59,663 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:27:59,684 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-10 15:27:59,685 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:59,705 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-10 15:27:59,706 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:59,714 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:27:59,714 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:59,731 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:59,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:59,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:59,858 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:59,859 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 143 [2020-07-10 15:27:59,872 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-10 15:27:59,873 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:59,884 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-10 15:27:59,885 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:59,890 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:27:59,890 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:59,897 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:28:00,514 WARN L193 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 45 [2020-07-10 15:28:00,516 INFO L624 ElimStorePlain]: treesize reduction 800, result has 14.5 percent of original size [2020-07-10 15:28:00,528 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:00,540 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-10 15:28:00,541 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:101 [2020-07-10 15:28:00,705 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:28:00,705 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, main_~i~0, v_prenex_5]. (let ((.cse1 (select |v_#memory_int_17| main_~a~0.base))) (let ((.cse0 (= 1 (select (select |v_#memory_int_17| main_~b~0.base) main_~b~0.offset))) (.cse4 (= |#memory_int| (store |v_#memory_int_17| main_~a~0.base (let ((.cse6 (* main_~i~0 8))) (store .cse1 (+ .cse6 main_~a~0.offset) (+ (select .cse1 (+ .cse6 main_~a~0.offset (- 8))) 10)))))) (.cse5 (not (= main_~a~0.base main_~b~0.base))) (.cse3 (select .cse1 main_~a~0.offset))) (or (and .cse0 (let ((.cse2 (* v_prenex_5 8))) (= (+ (select .cse1 (+ .cse2 main_~a~0.offset (- 8))) 10) (select .cse1 (+ .cse2 main_~a~0.offset)))) (= 1 .cse3) .cse4 .cse5) (and .cse0 .cse4 .cse5 (= .cse3 (+ (select .cse1 (+ main_~a~0.offset (- 8))) 10)))))) [2020-07-10 15:28:00,706 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0, v_prenex_6]. (let ((.cse2 (select |#memory_int| main_~a~0.base))) (let ((.cse0 (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (.cse1 (select .cse2 main_~a~0.offset)) (.cse4 (not (= main_~a~0.base main_~b~0.base)))) (or (and .cse0 (= 1 .cse1) (let ((.cse3 (* main_~i~0 8))) (= (+ (select .cse2 (+ .cse3 main_~a~0.offset (- 8))) 10) (select .cse2 (+ .cse3 main_~a~0.offset)))) .cse4) (let ((.cse7 (* v_prenex_6 8))) (let ((.cse6 (+ .cse7 main_~a~0.offset))) (and .cse0 (let ((.cse5 (+ main_~a~0.offset (- 8)))) (or (= .cse5 .cse6) (= (+ .cse1 (- 10)) (select .cse2 .cse5)))) (= (+ (select .cse2 (+ .cse7 main_~a~0.offset (- 8))) 10) (select .cse2 .cse6)) .cse4)))))) [2020-07-10 15:28:00,709 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:00,920 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-07-10 15:28:00,938 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:01,075 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:01,238 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:01,674 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-07-10 15:28:01,701 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:28:01,770 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:01,772 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:01,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:01,799 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:01,828 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:01,893 INFO L350 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2020-07-10 15:28:01,893 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 107 [2020-07-10 15:28:01,905 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:28:01,955 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:01,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:01,968 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:01,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:01,980 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:02,051 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:02,109 INFO L244 Elim1Store]: Index analysis took 154 ms [2020-07-10 15:28:02,116 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2020-07-10 15:28:02,144 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:28:02,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:02,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:02,203 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:02,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:02,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:02,217 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2020-07-10 15:28:02,233 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:28:02,671 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-07-10 15:28:02,672 INFO L624 ElimStorePlain]: treesize reduction 53, result has 79.5 percent of original size [2020-07-10 15:28:02,673 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-07-10 15:28:02,673 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:212, output treesize:206 [2020-07-10 15:28:03,152 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-07-10 15:28:03,180 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-07-10 15:28:03,181 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:28:03,488 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-07-10 15:28:03,515 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:28:03,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:03,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:03,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:03,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:03,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:03,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,140 INFO L244 Elim1Store]: Index analysis took 404 ms [2020-07-10 15:28:04,339 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-07-10 15:28:04,341 INFO L350 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2020-07-10 15:28:04,342 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 173 [2020-07-10 15:28:04,355 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:28:04,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,877 INFO L244 Elim1Store]: Index analysis took 453 ms [2020-07-10 15:28:04,908 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:28:04,909 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 100 [2020-07-10 15:28:04,922 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:28:04,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:04,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:05,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:05,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:05,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:05,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:05,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:05,044 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:28:05,045 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 107 [2020-07-10 15:28:05,058 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:28:05,625 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2020-07-10 15:28:05,627 INFO L624 ElimStorePlain]: treesize reduction 210, result has 53.6 percent of original size [2020-07-10 15:28:05,702 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2020-07-10 15:28:05,703 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:263, output treesize:243 [2020-07-10 15:28:05,769 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:28:05,770 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, main_~a~0.base, main_~i~0, main_~a~0.offset, v_prenex_7]. (let ((.cse6 (select |v_#memory_int_19| main_~a~0.base)) (.cse11 (select |v_#memory_int_19| main_~b~0.base))) (let ((.cse5 (select .cse11 (+ main_~b~0.offset 8))) (.cse3 (select .cse6 main_~a~0.offset)) (.cse8 (select .cse11 main_~b~0.offset))) (let ((.cse0 (<= 2 main_~i~0)) (.cse1 (= 1 .cse8)) (.cse2 (= (store |v_#memory_int_19| main_~b~0.base (let ((.cse12 (* main_~i~0 8))) (store .cse11 (+ main_~b~0.offset .cse12) (+ (select .cse6 (+ .cse12 main_~a~0.offset (- 8))) (select .cse11 (+ main_~b~0.offset .cse12 (- 8))))))) |#memory_int|)) (.cse10 (select .cse6 (+ main_~a~0.offset (- 8)))) (.cse4 (not (= main_~a~0.base main_~b~0.base))) (.cse9 (= .cse5 (+ .cse3 1)))) (or (and .cse0 .cse1 .cse2 (= 1 .cse3) .cse4 (= 2 .cse5) (let ((.cse7 (* v_prenex_7 8))) (= (+ (select .cse6 (+ .cse7 main_~a~0.offset (- 8))) 10) (select .cse6 (+ .cse7 main_~a~0.offset))))) (and .cse0 .cse2 (= (+ .cse8 .cse3) .cse5) .cse4 .cse9 (= (+ .cse10 10) .cse3)) (and .cse0 .cse1 .cse2 (= (+ (select .cse6 (+ main_~a~0.offset (- 16))) 10) .cse10) .cse4 .cse9))))) [2020-07-10 15:28:05,770 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_8, v_prenex_10, v_prenex_9, v_prenex_7, main_~i~0, main_~a~0.base, main_~a~0.offset, v_prenex_11, v_prenex_13, v_prenex_12]. (let ((.cse0 (select |#memory_int| main_~b~0.base))) (let ((.cse6 (select .cse0 main_~b~0.offset))) (let ((.cse3 (= .cse6 1)) (.cse5 (select .cse0 (+ main_~b~0.offset 8)))) (or (let ((.cse2 (select |#memory_int| main_~a~0.base))) (let ((.cse4 (select .cse2 main_~a~0.offset))) (and (<= 2 main_~i~0) (let ((.cse1 (* main_~i~0 8))) (= (select .cse0 (+ main_~b~0.offset .cse1)) (+ (select .cse0 (+ main_~b~0.offset .cse1 (- 8))) (select .cse2 (+ .cse1 main_~a~0.offset (- 8)))))) .cse3 (= (+ (select .cse2 (+ main_~a~0.offset (- 8))) 10) .cse4) (not (= main_~a~0.base main_~b~0.base)) (= .cse5 (+ .cse4 .cse6))))) (let ((.cse8 (select |#memory_int| v_prenex_10))) (and (<= 2 v_prenex_8) (let ((.cse7 (* v_prenex_8 8))) (= (select .cse0 (+ main_~b~0.offset .cse7)) (+ (select .cse0 (+ main_~b~0.offset .cse7 (- 8))) (select .cse8 (+ .cse7 v_prenex_9 (- 8)))))) (let ((.cse9 (* v_prenex_7 8))) (= (select .cse8 (+ .cse9 v_prenex_9)) (+ (select .cse8 (+ .cse9 v_prenex_9 (- 8))) 10))) .cse3 (= 1 (select .cse8 v_prenex_9)) (= 2 .cse5) (not (= v_prenex_10 main_~b~0.base)))) (let ((.cse11 (select |#memory_int| v_prenex_13))) (and (<= 2 v_prenex_11) (let ((.cse10 (* v_prenex_11 8))) (= (select .cse0 (+ main_~b~0.offset .cse10)) (+ (select .cse0 (+ main_~b~0.offset .cse10 (- 8))) (select .cse11 (+ .cse10 v_prenex_12 (- 8)))))) .cse3 (= (+ (select .cse11 v_prenex_12) 1) .cse5) (= (select .cse11 (+ v_prenex_12 (- 8))) (+ (select .cse11 (+ v_prenex_12 (- 16))) 10)) (not (= v_prenex_13 main_~b~0.base)))))))) [2020-07-10 15:28:12,240 WARN L193 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 99 [2020-07-10 15:28:21,936 WARN L193 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 102 [2020-07-10 15:28:21,983 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:28:22,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,323 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:22,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,344 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:22,484 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-07-10 15:28:22,485 INFO L350 Elim1Store]: treesize reduction 10, result has 81.5 percent of original size [2020-07-10 15:28:22,486 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 65 [2020-07-10 15:28:22,521 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:28:22,522 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:22,532 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:28:22,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,582 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:22,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:22,602 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:22,848 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-10 15:28:22,849 INFO L350 Elim1Store]: treesize reduction 17, result has 84.0 percent of original size [2020-07-10 15:28:22,849 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 111 [2020-07-10 15:28:22,883 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-10 15:28:22,884 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:28:22,891 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:28:22,891 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:22,907 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:28:22,915 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:22,921 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:22,923 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:22,966 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-10 15:28:22,967 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:28:22,977 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:28:22,977 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:22,997 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:28:23,004 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:23,011 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:23,014 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:23,024 INFO L544 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-10 15:28:23,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:23,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:23,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:23,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:23,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:23,106 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:28:23,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:28:23,344 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-07-10 15:28:23,345 INFO L350 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2020-07-10 15:28:23,345 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 80 [2020-07-10 15:28:23,374 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:28:23,375 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:23,383 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:28:23,384 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:23,406 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:28:23,420 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:28:23,498 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:28:23,499 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:23,509 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:28:23,509 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:23,535 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:28:23,551 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:28:23,606 INFO L544 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-10 15:28:24,151 WARN L193 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 74 [2020-07-10 15:28:24,155 INFO L624 ElimStorePlain]: treesize reduction 96, result has 60.2 percent of original size [2020-07-10 15:28:24,183 INFO L544 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:28:24,184 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:285, output treesize:7 [2020-07-10 15:28:24,223 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:28:24,224 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_prenex_10, v_prenex_8, v_prenex_9, main_~b~0.base, main_~b~0.offset, v_prenex_7, main_~a~0.base, v_prenex_14, main_~a~0.offset, v_prenex_11, v_prenex_13, v_prenex_12]. (let ((.cse7 (select |#memory_int| main_~b~0.base))) (let ((.cse6 (select .cse7 main_~b~0.offset))) (let ((.cse0 (= .cse6 1)) (.cse5 (select .cse7 (+ main_~b~0.offset 8))) (.cse1 (= (select .cse7 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|)) (.cse4 (= 0 main_~i~0))) (or (let ((.cse2 (select |#memory_int| main_~a~0.base))) (let ((.cse3 (select .cse2 main_~a~0.offset))) (and .cse0 .cse1 (= (+ (select .cse2 (+ main_~a~0.offset (- 8))) 10) .cse3) .cse4 (not (= main_~a~0.base main_~b~0.base)) (= .cse5 (+ .cse3 .cse6)) (let ((.cse8 (* v_prenex_14 8))) (= (select .cse7 (+ main_~b~0.offset .cse8)) (+ (select .cse2 (+ .cse8 main_~a~0.offset (- 8))) (select .cse7 (+ main_~b~0.offset .cse8 (- 8)))))) (<= 2 v_prenex_14)))) (let ((.cse9 (select |#memory_int| v_prenex_10))) (and (not (= v_prenex_10 main_~b~0.base)) (let ((.cse10 (* v_prenex_7 8))) (= (select .cse9 (+ .cse10 v_prenex_9)) (+ (select .cse9 (+ .cse10 v_prenex_9 (- 8))) 10))) .cse0 .cse1 .cse4 (= 1 (select .cse9 v_prenex_9)) (= 2 .cse5) (let ((.cse11 (* v_prenex_8 8))) (= (select .cse7 (+ main_~b~0.offset .cse11)) (+ (select .cse9 (+ .cse11 v_prenex_9 (- 8))) (select .cse7 (+ main_~b~0.offset .cse11 (- 8)))))) (<= 2 v_prenex_8))) (let ((.cse12 (select |#memory_int| v_prenex_13))) (and (not (= v_prenex_13 main_~b~0.base)) .cse0 (<= 2 v_prenex_11) (= (+ (select .cse12 v_prenex_12) 1) .cse5) .cse1 (let ((.cse13 (* v_prenex_11 8))) (= (select .cse7 (+ main_~b~0.offset .cse13)) (+ (select .cse7 (+ main_~b~0.offset .cse13 (- 8))) (select .cse12 (+ .cse13 v_prenex_12 (- 8)))))) .cse4 (= (select .cse12 (+ v_prenex_12 (- 8))) (+ (select .cse12 (+ v_prenex_12 (- 16))) 10)))))))) [2020-07-10 15:28:24,224 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-10 15:28:24,538 INFO L263 TraceCheckUtils]: 0: Hoare triple {2821#true} call ULTIMATE.init(); {2821#true} is VALID [2020-07-10 15:28:24,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {2821#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2821#true} is VALID [2020-07-10 15:28:24,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {2821#true} assume true; {2821#true} is VALID [2020-07-10 15:28:24,539 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2821#true} {2821#true} #81#return; {2821#true} is VALID [2020-07-10 15:28:24,539 INFO L263 TraceCheckUtils]: 4: Hoare triple {2821#true} call #t~ret10 := main(); {2821#true} is VALID [2020-07-10 15:28:24,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {2821#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2821#true} is VALID [2020-07-10 15:28:24,540 INFO L280 TraceCheckUtils]: 6: Hoare triple {2821#true} assume !(~N~0 <= 0); {2821#true} is VALID [2020-07-10 15:28:24,540 INFO L263 TraceCheckUtils]: 7: Hoare triple {2821#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2821#true} is VALID [2020-07-10 15:28:24,540 INFO L280 TraceCheckUtils]: 8: Hoare triple {2821#true} ~cond := #in~cond; {2821#true} is VALID [2020-07-10 15:28:24,540 INFO L280 TraceCheckUtils]: 9: Hoare triple {2821#true} assume !(0 == ~cond); {2821#true} is VALID [2020-07-10 15:28:24,540 INFO L280 TraceCheckUtils]: 10: Hoare triple {2821#true} assume true; {2821#true} is VALID [2020-07-10 15:28:24,540 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2821#true} {2821#true} #77#return; {2821#true} is VALID [2020-07-10 15:28:24,545 INFO L280 TraceCheckUtils]: 12: Hoare triple {2821#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {2862#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-10 15:28:24,559 INFO L280 TraceCheckUtils]: 13: Hoare triple {2862#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2866#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-10 15:28:24,561 INFO L280 TraceCheckUtils]: 14: Hoare triple {2866#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2866#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-10 15:28:24,589 INFO L280 TraceCheckUtils]: 15: Hoare triple {2866#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2873#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-10 15:28:24,591 INFO L280 TraceCheckUtils]: 16: Hoare triple {2873#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2873#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-10 15:28:24,592 INFO L280 TraceCheckUtils]: 17: Hoare triple {2873#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} assume !(~i~0 < ~N~0); {2873#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-10 15:28:24,612 INFO L280 TraceCheckUtils]: 18: Hoare triple {2873#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} ~i~0 := 1; {2883#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (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 (- 16))) 10)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-10 15:28:24,641 INFO L280 TraceCheckUtils]: 19: Hoare triple {2883#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (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 (- 16))) 10)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (not (= main_~a~0.base main_~b~0.base))))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {2887#(or (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 1)) (= 1 main_~i~0) (= (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 (- 16))) 10)) (= 1 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8)))) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 1)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) 2) (= 1 main_~i~0) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (= 1 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (= 1 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8)))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-10 15:28:24,665 INFO L280 TraceCheckUtils]: 20: Hoare triple {2887#(or (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 1)) (= 1 main_~i~0) (= (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 (- 16))) 10)) (= 1 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8)))) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 1)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) 2) (= 1 main_~i~0) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (= 1 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (= 1 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8)))) (not (= main_~a~0.base main_~b~0.base))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2891#(or (and (<= 2 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset)))) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base))) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (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 (- 16))) 10)) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-10 15:28:26,685 INFO L280 TraceCheckUtils]: 21: Hoare triple {2891#(or (and (<= 2 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset)))) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base))) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (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 (- 16))) 10)) (not (= main_~a~0.base main_~b~0.base))))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {2895#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} is UNKNOWN [2020-07-10 15:28:26,687 INFO L280 TraceCheckUtils]: 22: Hoare triple {2895#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2895#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} is VALID [2020-07-10 15:28:26,688 INFO L280 TraceCheckUtils]: 23: Hoare triple {2895#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} assume !(~i~0 < ~N~0); {2895#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} is VALID [2020-07-10 15:28:26,742 INFO L280 TraceCheckUtils]: 24: Hoare triple {2895#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} ~i~0 := 0; {2905#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_14 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_14 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_14 8) main_~a~0.offset (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_14 8) (- 8))))) (<= 2 v_prenex_14))) (= 0 main_~i~0)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 0 main_~i~0) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} is VALID [2020-07-10 15:28:26,760 INFO L280 TraceCheckUtils]: 25: Hoare triple {2905#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_14 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_14 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_14 8) main_~a~0.offset (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_14 8) (- 8))))) (<= 2 v_prenex_14))) (= 0 main_~i~0)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 0 main_~i~0) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2909#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} is VALID [2020-07-10 15:28:26,768 INFO L263 TraceCheckUtils]: 26: Hoare triple {2909#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {2913#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:28:26,769 INFO L280 TraceCheckUtils]: 27: Hoare triple {2913#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2917#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:28:26,770 INFO L280 TraceCheckUtils]: 28: Hoare triple {2917#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2822#false} is VALID [2020-07-10 15:28:26,771 INFO L280 TraceCheckUtils]: 29: Hoare triple {2822#false} assume !false; {2822#false} is VALID [2020-07-10 15:28:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:26,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80126967] [2020-07-10 15:28:26,782 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:28:26,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214282431] [2020-07-10 15:28:26,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:28:26,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-10 15:28:26,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030990383] [2020-07-10 15:28:26,783 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-10 15:28:26,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:26,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:28:33,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 27 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:33,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:28:33,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:33,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:28:33,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=126, Unknown=2, NotChecked=0, Total=156 [2020-07-10 15:28:33,236 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 13 states. [2020-07-10 15:28:39,474 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2020-07-10 15:28:44,472 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2020-07-10 15:28:45,359 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2020-07-10 15:28:59,413 WARN L193 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 118 DAG size of output: 118 [2020-07-10 15:29:10,958 WARN L193 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 143 DAG size of output: 126 [2020-07-10 15:29:22,359 WARN L193 SmtUtils]: Spent 7.37 s on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2020-07-10 15:29:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:37,919 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-10 15:29:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:29:37,919 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-10 15:29:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2020-07-10 15:29:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2020-07-10 15:29:37,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 76 transitions. [2020-07-10 15:29:47,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 74 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:47,807 INFO L225 Difference]: With dead ends: 77 [2020-07-10 15:29:47,807 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 15:29:47,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 51.6s TimeCoverageRelationStatistics Valid=65, Invalid=312, Unknown=3, NotChecked=0, Total=380 [2020-07-10 15:29:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 15:29:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 54. [2020-07-10 15:29:48,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:48,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 54 states. [2020-07-10 15:29:48,122 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 54 states. [2020-07-10 15:29:48,122 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 54 states. [2020-07-10 15:29:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:48,127 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2020-07-10 15:29:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2020-07-10 15:29:48,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:48,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:48,128 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 75 states. [2020-07-10 15:29:48,128 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 75 states. [2020-07-10 15:29:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:48,131 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2020-07-10 15:29:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2020-07-10 15:29:48,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:48,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:48,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:48,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 15:29:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-10 15:29:48,134 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 30 [2020-07-10 15:29:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:48,135 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-10 15:29:48,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:29:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-10 15:29:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 15:29:48,136 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:48,136 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:48,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-10 15:29:48,339 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:48,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1569644609, now seen corresponding path program 5 times [2020-07-10 15:29:48,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:48,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602493306] [2020-07-10 15:29:48,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:48,363 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:29:48,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384492511] [2020-07-10 15:29:48,363 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2020-07-10 15:29:48,408 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-07-10 15:29:48,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:48,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:29:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:48,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:48,750 INFO L263 TraceCheckUtils]: 0: Hoare triple {3276#true} call ULTIMATE.init(); {3276#true} is VALID [2020-07-10 15:29:48,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {3276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {3276#true} is VALID [2020-07-10 15:29:48,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {3276#true} assume true; {3276#true} is VALID [2020-07-10 15:29:48,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3276#true} {3276#true} #81#return; {3276#true} is VALID [2020-07-10 15:29:48,751 INFO L263 TraceCheckUtils]: 4: Hoare triple {3276#true} call #t~ret10 := main(); {3276#true} is VALID [2020-07-10 15:29:48,752 INFO L280 TraceCheckUtils]: 5: Hoare triple {3276#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {3276#true} is VALID [2020-07-10 15:29:48,752 INFO L280 TraceCheckUtils]: 6: Hoare triple {3276#true} assume !(~N~0 <= 0); {3276#true} is VALID [2020-07-10 15:29:48,752 INFO L263 TraceCheckUtils]: 7: Hoare triple {3276#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {3276#true} is VALID [2020-07-10 15:29:48,752 INFO L280 TraceCheckUtils]: 8: Hoare triple {3276#true} ~cond := #in~cond; {3276#true} is VALID [2020-07-10 15:29:48,753 INFO L280 TraceCheckUtils]: 9: Hoare triple {3276#true} assume !(0 == ~cond); {3276#true} is VALID [2020-07-10 15:29:48,753 INFO L280 TraceCheckUtils]: 10: Hoare triple {3276#true} assume true; {3276#true} is VALID [2020-07-10 15:29:48,753 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3276#true} {3276#true} #77#return; {3276#true} is VALID [2020-07-10 15:29:48,755 INFO L280 TraceCheckUtils]: 12: Hoare triple {3276#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {3317#(<= 1 main_~i~0)} is VALID [2020-07-10 15:29:48,756 INFO L280 TraceCheckUtils]: 13: Hoare triple {3317#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3317#(<= 1 main_~i~0)} is VALID [2020-07-10 15:29:48,765 INFO L280 TraceCheckUtils]: 14: Hoare triple {3317#(<= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3324#(<= 2 main_~i~0)} is VALID [2020-07-10 15:29:48,766 INFO L280 TraceCheckUtils]: 15: Hoare triple {3324#(<= 2 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3324#(<= 2 main_~i~0)} is VALID [2020-07-10 15:29:48,775 INFO L280 TraceCheckUtils]: 16: Hoare triple {3324#(<= 2 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3331#(<= 3 main_~i~0)} is VALID [2020-07-10 15:29:48,777 INFO L280 TraceCheckUtils]: 17: Hoare triple {3331#(<= 3 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3335#(<= 4 ~N~0)} is VALID [2020-07-10 15:29:48,778 INFO L280 TraceCheckUtils]: 18: Hoare triple {3335#(<= 4 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3335#(<= 4 ~N~0)} is VALID [2020-07-10 15:29:48,779 INFO L280 TraceCheckUtils]: 19: Hoare triple {3335#(<= 4 ~N~0)} assume !(~i~0 < ~N~0); {3335#(<= 4 ~N~0)} is VALID [2020-07-10 15:29:48,781 INFO L280 TraceCheckUtils]: 20: Hoare triple {3335#(<= 4 ~N~0)} ~i~0 := 1; {3345#(and (<= 4 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:29:48,782 INFO L280 TraceCheckUtils]: 21: Hoare triple {3345#(and (<= 4 ~N~0) (<= main_~i~0 1))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {3345#(and (<= 4 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:29:48,789 INFO L280 TraceCheckUtils]: 22: Hoare triple {3345#(and (<= 4 ~N~0) (<= main_~i~0 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3352#(and (<= main_~i~0 2) (<= 4 ~N~0))} is VALID [2020-07-10 15:29:48,791 INFO L280 TraceCheckUtils]: 23: Hoare triple {3352#(and (<= main_~i~0 2) (<= 4 ~N~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {3352#(and (<= main_~i~0 2) (<= 4 ~N~0))} is VALID [2020-07-10 15:29:48,802 INFO L280 TraceCheckUtils]: 24: Hoare triple {3352#(and (<= main_~i~0 2) (<= 4 ~N~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3359#(and (<= main_~i~0 3) (<= 4 ~N~0))} is VALID [2020-07-10 15:29:48,803 INFO L280 TraceCheckUtils]: 25: Hoare triple {3359#(and (<= main_~i~0 3) (<= 4 ~N~0))} assume !(~i~0 < ~N~0); {3277#false} is VALID [2020-07-10 15:29:48,804 INFO L280 TraceCheckUtils]: 26: Hoare triple {3277#false} ~i~0 := 0; {3277#false} is VALID [2020-07-10 15:29:48,804 INFO L280 TraceCheckUtils]: 27: Hoare triple {3277#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {3277#false} is VALID [2020-07-10 15:29:48,804 INFO L263 TraceCheckUtils]: 28: Hoare triple {3277#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {3277#false} is VALID [2020-07-10 15:29:48,804 INFO L280 TraceCheckUtils]: 29: Hoare triple {3277#false} ~cond := #in~cond; {3277#false} is VALID [2020-07-10 15:29:48,804 INFO L280 TraceCheckUtils]: 30: Hoare triple {3277#false} assume 0 == ~cond; {3277#false} is VALID [2020-07-10 15:29:48,805 INFO L280 TraceCheckUtils]: 31: Hoare triple {3277#false} assume !false; {3277#false} is VALID [2020-07-10 15:29:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:48,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602493306] [2020-07-10 15:29:48,806 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:29:48,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384492511] [2020-07-10 15:29:48,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:29:48,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-10 15:29:48,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232464872] [2020-07-10 15:29:48,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-07-10 15:29:48,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:48,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:29:48,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:48,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:29:48,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:48,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:29:48,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:29:48,937 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 9 states. [2020-07-10 15:29:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:52,447 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2020-07-10 15:29:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:29:52,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-07-10 15:29:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:29:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2020-07-10 15:29:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:29:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2020-07-10 15:29:52,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 92 transitions. [2020-07-10 15:29:52,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:52,751 INFO L225 Difference]: With dead ends: 100 [2020-07-10 15:29:52,751 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 15:29:52,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:29:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 15:29:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2020-07-10 15:29:52,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:52,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 56 states. [2020-07-10 15:29:52,938 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 56 states. [2020-07-10 15:29:52,938 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 56 states. [2020-07-10 15:29:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:52,941 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2020-07-10 15:29:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2020-07-10 15:29:52,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:52,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:52,942 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 89 states. [2020-07-10 15:29:52,943 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 89 states. [2020-07-10 15:29:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:52,945 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2020-07-10 15:29:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2020-07-10 15:29:52,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:52,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:52,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:52,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 15:29:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-07-10 15:29:52,948 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2020-07-10 15:29:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:52,948 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-07-10 15:29:52,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:29:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-10 15:29:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:29:52,949 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:52,949 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:53,155 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:53,157 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:53,158 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-10 15:29:53,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:53,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345297073] [2020-07-10 15:29:53,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:53,166 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:29:53,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802875478] [2020-07-10 15:29:53,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:29:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:29:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:29:53,254 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:29:53,254 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:29:53,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:53,505 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:29:53,505 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:29:53,505 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:29:53,505 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:53,505 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:29:53,505 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:29:53,506 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:29:53,506 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:29:53,506 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:29:53,506 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:29:53,506 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:29:53,506 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:29:53,506 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:29:53,506 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:29:53,507 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:29:53,507 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:53,507 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:53,507 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:29:53,507 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:53,507 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:29:53,507 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:29:53,507 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:29:53,507 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:29:53,508 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:29:53,508 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:29:53,508 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:53,508 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:29:53,508 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:53,508 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:29:53,508 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:29:53,508 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:29:53,508 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-10 15:29:53,509 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:29:53,509 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-10 15:29:53,509 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 15:29:53,509 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:29:53,509 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:29:53,509 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:29:53,509 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:29:53,509 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:29:53,509 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:29:53,509 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-10 15:29:53,510 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 15:29:53,510 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-10 15:29:53,510 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 15:29:53,510 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 15:29:53,510 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:53,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:53 BoogieIcfgContainer [2020-07-10 15:29:53,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:53,515 INFO L168 Benchmark]: Toolchain (without parser) took 219623.54 ms. Allocated memory was 146.3 MB in the beginning and 266.3 MB in the end (delta: 120.1 MB). Free memory was 103.4 MB in the beginning and 155.2 MB in the end (delta: -51.8 MB). Peak memory consumption was 68.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:53,516 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:53,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.41 ms. Allocated memory is still 146.3 MB. Free memory was 103.0 MB in the beginning and 92.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:53,516 INFO L168 Benchmark]: Boogie Preprocessor took 211.48 ms. Allocated memory was 146.3 MB in the beginning and 206.0 MB in the end (delta: 59.8 MB). Free memory was 92.2 MB in the beginning and 183.4 MB in the end (delta: -91.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:53,517 INFO L168 Benchmark]: RCFGBuilder took 624.11 ms. Allocated memory is still 206.0 MB. Free memory was 183.4 MB in the beginning and 158.7 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:53,517 INFO L168 Benchmark]: TraceAbstraction took 218465.19 ms. Allocated memory was 206.0 MB in the beginning and 266.3 MB in the end (delta: 60.3 MB). Free memory was 158.0 MB in the beginning and 155.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:53,519 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.41 ms. Allocated memory is still 146.3 MB. Free memory was 103.0 MB in the beginning and 92.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 211.48 ms. Allocated memory was 146.3 MB in the beginning and 206.0 MB in the end (delta: 59.8 MB). Free memory was 92.2 MB in the beginning and 183.4 MB in the end (delta: -91.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 624.11 ms. Allocated memory is still 206.0 MB. Free memory was 183.4 MB in the beginning and 158.7 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218465.19 ms. Allocated memory was 206.0 MB in the beginning and 266.3 MB in the end (delta: 60.3 MB). Free memory was 158.0 MB in the beginning and 155.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=3, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] a[0] = 1 [L30] b[0] = 1 [L31] i=1 VAL [\old(N)=0, a={-2:0}, b={-1:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={-2:0}, N=2] [L31] COND TRUE i