/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/eqn2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:48:57,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:48:57,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:48:57,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:48:57,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:48:57,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:48:57,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:48:57,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:48:57,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:48:57,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:48:57,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:48:57,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:48:57,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:48:57,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:48:57,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:48:57,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:48:57,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:48:57,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:48:57,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:48:57,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:48:57,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:48:57,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:48:57,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:48:57,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:48:57,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:48:57,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:48:57,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:48:57,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:48:57,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:48:57,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:48:57,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:48:57,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:48:57,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:48:57,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:48:57,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:48:57,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:48:57,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:48:57,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:48:57,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:48:57,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:48:57,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:48:57,274 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-17 22:48:57,308 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:48:57,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:48:57,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:48:57,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:48:57,316 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:48:57,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:48:57,316 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:48:57,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:48:57,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:48:57,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:48:57,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:48:57,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:48:57,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:48:57,318 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:48:57,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:48:57,318 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:48:57,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:48:57,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:48:57,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:48:57,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:48:57,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:48:57,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:48:57,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:48:57,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:48:57,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:48:57,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:48:57,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:48:57,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:48:57,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:48:57,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:48:57,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:48:57,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:48:57,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:48:57,661 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:48:57,662 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:48:57,663 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-17 22:48:57,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9149a5ebb/ba4e095706bd41a59e367bb5f32d732c/FLAG9b590a139 [2020-07-17 22:48:58,198 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:48:58,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-17 22:48:58,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9149a5ebb/ba4e095706bd41a59e367bb5f32d732c/FLAG9b590a139 [2020-07-17 22:48:58,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9149a5ebb/ba4e095706bd41a59e367bb5f32d732c [2020-07-17 22:48:58,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:48:58,612 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:48:58,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:58,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:48:58,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:48:58,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce2c956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58, skipping insertion in model container [2020-07-17 22:48:58,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:48:58,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:48:58,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:58,851 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:48:58,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:58,894 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:48:58,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58 WrapperNode [2020-07-17 22:48:58,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:58,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:48:58,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:48:58,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:48:59,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:59,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:59,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:59,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:59,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:59,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:59,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:59,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:48:59,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:48:59,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:48:59,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:48:59,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (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-17 22:48:59,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:48:59,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:48:59,163 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:48:59,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:48:59,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:48:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:48:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:48:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:48:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:48:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:48:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:48:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:48:59,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:48:59,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:48:59,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:48:59,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:48:59,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:48:59,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:48:59,625 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:48:59,625 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:48:59,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:59 BoogieIcfgContainer [2020-07-17 22:48:59,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:48:59,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:48:59,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:48:59,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:48:59,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:48:58" (1/3) ... [2020-07-17 22:48:59,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a6f7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:59, skipping insertion in model container [2020-07-17 22:48:59,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (2/3) ... [2020-07-17 22:48:59,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a6f7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:59, skipping insertion in model container [2020-07-17 22:48:59,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:59" (3/3) ... [2020-07-17 22:48:59,639 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2f.c [2020-07-17 22:48:59,651 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:48:59,660 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:48:59,679 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:48:59,704 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:48:59,705 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:48:59,705 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:48:59,705 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:48:59,706 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:48:59,706 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:48:59,706 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:48:59,706 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:48:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-17 22:48:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:48:59,732 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:59,733 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-17 22:48:59,733 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-17 22:48:59,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:59,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024109927] [2020-07-17 22:48:59,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:00,014 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-17 22:49:00,015 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-17 22:49:00,016 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-17 22:49:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:00,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-17 22:49:00,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-17 22:49:00,036 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-17 22:49:00,036 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-17 22:49:00,038 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-17 22:49:00,039 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-17 22:49:00,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-17 22:49:00,040 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-17 22:49:00,040 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID [2020-07-17 22:49:00,041 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-17 22:49:00,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(~N~0 <= 0); {37#true} is VALID [2020-07-17 22:49:00,042 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-17 22:49:00,042 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-17 22:49:00,043 INFO L280 TraceCheckUtils]: 9: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-17 22:49:00,044 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-17 22:49:00,044 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-17 22:49:00,045 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(8, ~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-17 22:49:00,045 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-17 22:49:00,046 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} ~i~0 := 1; {38#false} is VALID [2020-07-17 22:49:00,046 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-17 22:49:00,046 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-17 22:49:00,047 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-17 22:49:00,047 INFO L263 TraceCheckUtils]: 18: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {38#false} is VALID [2020-07-17 22:49:00,048 INFO L280 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2020-07-17 22:49:00,048 INFO L280 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2020-07-17 22:49:00,049 INFO L280 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-17 22:49:00,052 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-17 22:49:00,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024109927] [2020-07-17 22:49:00,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:00,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:00,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574439739] [2020-07-17 22:49:00,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:00,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:00,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:00,126 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-17 22:49:00,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:00,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:00,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:00,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:00,142 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-17 22:49:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:00,391 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-17 22:49:00,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:00,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-17 22:49:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-17 22:49:00,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2020-07-17 22:49:00,583 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-17 22:49:00,610 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:49:00,612 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:49:00,620 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-17 22:49:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:49:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-17 22:49:00,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:00,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:00,720 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:00,720 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:00,735 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:49:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:00,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:00,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:00,739 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:00,739 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:00,747 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:49:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:00,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:00,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:00,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:00,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:49:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-17 22:49:00,757 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-17 22:49:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:00,758 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-17 22:49:00,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:00,763 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:00,763 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-17 22:49:00,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:00,765 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-17 22:49:00,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:00,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992570217] [2020-07-17 22:49:00,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:00,818 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:00,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322267777] [2020-07-17 22:49:00,819 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-17 22:49:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:00,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:49:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:00,889 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:01,008 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:01,009 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 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-17 22:49:01,010 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:01,038 INFO L624 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2020-07-17 22:49:01,042 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-17 22:49:01,042 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2020-07-17 22:49:01,050 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:01,051 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 8)))) (store .cse0 main_~b~0.base (store (select .cse0 main_~b~0.base) main_~b~0.offset 1))) |#memory_int|) [2020-07-17 22:49:01,051 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) [2020-07-17 22:49:01,118 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:01,119 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-17 22:49:01,120 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-17 22:49:01,134 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-17 22:49:01,135 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-17 22:49:01,136 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-17 22:49:01,139 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:01,139 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-17 22:49:01,140 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-17 22:49:01,203 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {221#true} is VALID [2020-07-17 22:49:01,204 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-17 22:49:01,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:01,204 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-17 22:49:01,205 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret10 := main(); {221#true} is VALID [2020-07-17 22:49:01,205 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-17 22:49:01,206 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {221#true} is VALID [2020-07-17 22:49:01,206 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-17 22:49:01,206 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-17 22:49:01,207 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-17 22:49:01,207 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:01,208 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {221#true} #77#return; {221#true} is VALID [2020-07-17 22:49:01,211 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(8, ~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-17 22:49:01,212 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-17 22:49:01,214 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-17 22:49:01,215 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-17 22:49:01,216 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-17 22:49:01,218 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-17 22:49:01,220 INFO L263 TraceCheckUtils]: 18: Hoare triple {279#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:49:01,221 INFO L280 TraceCheckUtils]: 19: Hoare triple {283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:49:01,223 INFO L280 TraceCheckUtils]: 20: Hoare triple {287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {222#false} is VALID [2020-07-17 22:49:01,223 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-17 22:49:01,225 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-17 22:49:01,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992570217] [2020-07-17 22:49:01,225 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:01,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322267777] [2020-07-17 22:49:01,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:01,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:49:01,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821951485] [2020-07-17 22:49:01,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:49:01,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:01,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:49:01,269 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-17 22:49:01,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:49:01,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:01,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:49:01,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:49:01,272 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-17 22:49:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:01,718 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-17 22:49:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:49:01,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:49:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-17 22:49:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-17 22:49:01,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2020-07-17 22:49:01,836 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-17 22:49:01,839 INFO L225 Difference]: With dead ends: 47 [2020-07-17 22:49:01,839 INFO L226 Difference]: Without dead ends: 45 [2020-07-17 22:49:01,841 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-17 22:49:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-17 22:49:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-17 22:49:01,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:01,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 39 states. [2020-07-17 22:49:01,880 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 39 states. [2020-07-17 22:49:01,881 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 39 states. [2020-07-17 22:49:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:01,887 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-17 22:49:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-17 22:49:01,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:01,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:01,889 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 45 states. [2020-07-17 22:49:01,889 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 45 states. [2020-07-17 22:49:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:01,894 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-17 22:49:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-17 22:49:01,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:01,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:01,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:01,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:49:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-17 22:49:01,900 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-17 22:49:01,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:01,900 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-17 22:49:01,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:49:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-17 22:49:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:49:01,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:01,902 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-17 22:49:02,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:49:02,119 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:02,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:02,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-17 22:49:02,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:02,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216276040] [2020-07-17 22:49:02,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:02,145 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:02,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986806555] [2020-07-17 22:49:02,145 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-17 22:49:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:02,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:49:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:02,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:02,298 INFO L263 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2020-07-17 22:49:02,298 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-17 22:49:02,299 INFO L280 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2020-07-17 22:49:02,299 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #81#return; {507#true} is VALID [2020-07-17 22:49:02,299 INFO L263 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret10 := main(); {507#true} is VALID [2020-07-17 22:49:02,300 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-17 22:49:02,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {507#true} assume !(~N~0 <= 0); {507#true} is VALID [2020-07-17 22:49:02,300 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-17 22:49:02,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2020-07-17 22:49:02,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2020-07-17 22:49:02,301 INFO L280 TraceCheckUtils]: 10: Hoare triple {507#true} assume true; {507#true} is VALID [2020-07-17 22:49:02,302 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {507#true} {507#true} #77#return; {507#true} is VALID [2020-07-17 22:49:02,304 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(8, ~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-17 22:49:02,305 INFO L280 TraceCheckUtils]: 13: Hoare triple {548#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {552#(<= ~N~0 1)} is VALID [2020-07-17 22:49:02,306 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-17 22:49:02,308 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~mem6;havoc #t~mem7; {508#false} is VALID [2020-07-17 22:49:02,308 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-17 22:49:02,309 INFO L280 TraceCheckUtils]: 17: Hoare triple {508#false} assume !(~i~0 < ~N~0); {508#false} is VALID [2020-07-17 22:49:02,309 INFO L280 TraceCheckUtils]: 18: Hoare triple {508#false} ~i~0 := 0; {508#false} is VALID [2020-07-17 22:49:02,309 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-17 22:49:02,310 INFO L263 TraceCheckUtils]: 20: Hoare triple {508#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {508#false} is VALID [2020-07-17 22:49:02,310 INFO L280 TraceCheckUtils]: 21: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2020-07-17 22:49:02,310 INFO L280 TraceCheckUtils]: 22: Hoare triple {508#false} assume 0 == ~cond; {508#false} is VALID [2020-07-17 22:49:02,310 INFO L280 TraceCheckUtils]: 23: Hoare triple {508#false} assume !false; {508#false} is VALID [2020-07-17 22:49:02,312 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-17 22:49:02,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216276040] [2020-07-17 22:49:02,312 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:02,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986806555] [2020-07-17 22:49:02,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:02,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:02,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048884500] [2020-07-17 22:49:02,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:49:02,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:02,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:02,348 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-17 22:49:02,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:02,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:02,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:02,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:02,350 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-17 22:49:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:02,639 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-17 22:49:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:02,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:49:02,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-17 22:49:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-17 22:49:02,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2020-07-17 22:49:02,739 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-17 22:49:02,742 INFO L225 Difference]: With dead ends: 71 [2020-07-17 22:49:02,743 INFO L226 Difference]: Without dead ends: 58 [2020-07-17 22:49:02,744 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-17 22:49:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-17 22:49:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-17 22:49:02,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:02,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 39 states. [2020-07-17 22:49:02,787 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 39 states. [2020-07-17 22:49:02,788 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 39 states. [2020-07-17 22:49:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:02,792 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-17 22:49:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-17 22:49:02,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:02,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:02,796 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 58 states. [2020-07-17 22:49:02,796 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 58 states. [2020-07-17 22:49:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:02,802 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-17 22:49:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-17 22:49:02,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:02,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:02,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:02,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:49:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-17 22:49:02,809 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-17 22:49:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:02,810 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-17 22:49:02,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-17 22:49:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:49:02,815 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:02,815 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-17 22:49:03,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:03,024 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-17 22:49:03,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:03,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021400709] [2020-07-17 22:49:03,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:03,048 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:03,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [469123269] [2020-07-17 22:49:03,048 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-17 22:49:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:03,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:49:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:03,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:03,177 INFO L263 TraceCheckUtils]: 0: Hoare triple {856#true} call ULTIMATE.init(); {856#true} is VALID [2020-07-17 22:49:03,177 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-17 22:49:03,178 INFO L280 TraceCheckUtils]: 2: Hoare triple {856#true} assume true; {856#true} is VALID [2020-07-17 22:49:03,178 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {856#true} {856#true} #81#return; {856#true} is VALID [2020-07-17 22:49:03,178 INFO L263 TraceCheckUtils]: 4: Hoare triple {856#true} call #t~ret10 := main(); {856#true} is VALID [2020-07-17 22:49:03,179 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-17 22:49:03,179 INFO L280 TraceCheckUtils]: 6: Hoare triple {856#true} assume !(~N~0 <= 0); {856#true} is VALID [2020-07-17 22:49:03,179 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-17 22:49:03,180 INFO L280 TraceCheckUtils]: 8: Hoare triple {856#true} ~cond := #in~cond; {856#true} is VALID [2020-07-17 22:49:03,180 INFO L280 TraceCheckUtils]: 9: Hoare triple {856#true} assume !(0 == ~cond); {856#true} is VALID [2020-07-17 22:49:03,180 INFO L280 TraceCheckUtils]: 10: Hoare triple {856#true} assume true; {856#true} is VALID [2020-07-17 22:49:03,180 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {856#true} {856#true} #77#return; {856#true} is VALID [2020-07-17 22:49:03,182 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(8, ~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-17 22:49:03,184 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {901#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:03,186 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-17 22:49:03,187 INFO L280 TraceCheckUtils]: 15: Hoare triple {901#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {901#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:03,189 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-17 22:49:03,190 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-17 22:49:03,190 INFO L280 TraceCheckUtils]: 18: Hoare triple {857#false} ~i~0 := 0; {857#false} is VALID [2020-07-17 22:49:03,191 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-17 22:49:03,191 INFO L263 TraceCheckUtils]: 20: Hoare triple {857#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {857#false} is VALID [2020-07-17 22:49:03,191 INFO L280 TraceCheckUtils]: 21: Hoare triple {857#false} ~cond := #in~cond; {857#false} is VALID [2020-07-17 22:49:03,191 INFO L280 TraceCheckUtils]: 22: Hoare triple {857#false} assume 0 == ~cond; {857#false} is VALID [2020-07-17 22:49:03,192 INFO L280 TraceCheckUtils]: 23: Hoare triple {857#false} assume !false; {857#false} is VALID [2020-07-17 22:49:03,193 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-17 22:49:03,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021400709] [2020-07-17 22:49:03,194 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:03,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469123269] [2020-07-17 22:49:03,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:03,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-17 22:49:03,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304709050] [2020-07-17 22:49:03,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:49:03,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:03,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:03,230 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-17 22:49:03,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:03,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:03,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:03,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:03,232 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2020-07-17 22:49:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:03,539 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-17 22:49:03,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:49:03,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:49:03,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-17 22:49:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-17 22:49:03,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2020-07-17 22:49:03,638 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-17 22:49:03,641 INFO L225 Difference]: With dead ends: 66 [2020-07-17 22:49:03,641 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 22:49:03,642 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-17 22:49:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 22:49:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-17 22:49:03,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:03,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 40 states. [2020-07-17 22:49:03,693 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 40 states. [2020-07-17 22:49:03,693 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 40 states. [2020-07-17 22:49:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:03,697 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-17 22:49:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:49:03,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:03,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:03,698 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 55 states. [2020-07-17 22:49:03,698 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 55 states. [2020-07-17 22:49:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:03,702 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-17 22:49:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:49:03,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:03,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:03,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:03,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:49:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-17 22:49:03,705 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-17 22:49:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:03,705 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-17 22:49:03,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-17 22:49:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:49:03,706 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:03,706 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-17 22:49:03,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:03,920 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:03,921 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-17 22:49:03,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:03,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002531269] [2020-07-17 22:49:03,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:03,945 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:03,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673576884] [2020-07-17 22:49:03,948 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-17 22:49:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:04,002 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-17 22:49:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:04,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:04,072 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-17 22:49:04,075 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:04,083 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:04,093 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-17 22:49:04,094 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:04,103 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:04,103 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-17 22:49:04,104 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-17 22:49:04,109 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:04,109 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 8)))) (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-17 22:49:04,110 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) [2020-07-17 22:49:04,192 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-17 22:49:04,193 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-17 22:49:04,205 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:04,245 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-17 22:49:04,251 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:04,265 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-17 22:49:04,266 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-17 22:49:04,303 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:04,304 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 (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))) 4)))) |#memory_int|) (not (= main_~a~0.base main_~b~0.base)) (= 8 (select .cse0 main_~a~0.offset)))) [2020-07-17 22:49:04,304 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) (not (= main_~a~0.base main_~b~0.base)) (or (= main_~a~0.offset .cse0) (= 8 (select .cse1 main_~a~0.offset))) (= (+ (select .cse1 (+ .cse2 main_~a~0.offset (- 8))) 4) (select .cse1 .cse0))))) [2020-07-17 22:49:04,307 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:04,367 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:04,429 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:04,475 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:04,609 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-17 22:49:04,610 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:04,645 INFO L440 ElimStorePlain]: Different costs {12=[v_prenex_3], 20=[|v_#memory_int_14|]} [2020-07-17 22:49:04,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:04,665 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-17 22:49:04,666 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-17 22:49:04,672 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:04,754 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:04,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:04,798 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-17 22:49:04,799 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-17 22:49:04,816 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:04,908 INFO L624 ElimStorePlain]: treesize reduction 69, result has 62.5 percent of original size [2020-07-17 22:49:04,919 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-17 22:49:04,920 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:115 [2020-07-17 22:49:04,947 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:04,948 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|, main_~a~0.base, main_~a~0.offset, v_prenex_1, v_prenex_3, v_prenex_4, v_prenex_2]. (let ((.cse5 (+ main_~b~0.offset 8))) (or (let ((.cse4 (select |v_#memory_int_14| main_~b~0.base)) (.cse2 (select |v_#memory_int_14| main_~a~0.base))) (let ((.cse1 (select .cse2 main_~a~0.offset)) (.cse0 (select .cse4 main_~b~0.offset))) (and (= 1 .cse0) (= 8 .cse1) (let ((.cse3 (* v_prenex_1 8))) (= (select .cse2 (+ .cse3 main_~a~0.offset)) (+ (select .cse2 (+ .cse3 main_~a~0.offset (- 8))) 4))) (= |#memory_int| (store |v_#memory_int_14| main_~b~0.base (store .cse4 .cse5 (+ .cse1 .cse0)))) (not (= main_~a~0.base main_~b~0.base))))) (let ((.cse9 (select v_prenex_3 main_~b~0.base)) (.cse8 (select v_prenex_3 v_prenex_4))) (let ((.cse7 (select .cse8 v_prenex_2)) (.cse6 (select .cse9 main_~b~0.offset))) (and (= 1 .cse6) (= .cse7 (+ (select .cse8 (+ v_prenex_2 (- 8))) 4)) (not (= v_prenex_4 main_~b~0.base)) (= |#memory_int| (store v_prenex_3 main_~b~0.base (store .cse9 .cse5 (+ .cse7 .cse6))))))))) [2020-07-17 22:49:04,948 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~a~0.base, main_~a~0.offset, v_prenex_1, v_prenex_4, v_prenex_2]. (let ((.cse7 (select |#memory_int| main_~b~0.base))) (let ((.cse3 (select .cse7 main_~b~0.offset))) (let ((.cse1 (select .cse7 (+ main_~b~0.offset 8))) (.cse0 (= .cse3 1))) (or (let ((.cse2 (select |#memory_int| main_~a~0.base))) (and .cse0 (not (= main_~a~0.base main_~b~0.base)) (= .cse1 (+ (select .cse2 main_~a~0.offset) .cse3)) (let ((.cse4 (* v_prenex_1 8))) (= (+ (select .cse2 (+ .cse4 main_~a~0.offset (- 8))) 4) (select .cse2 (+ .cse4 main_~a~0.offset)))) (= (+ .cse3 8) .cse1))) (let ((.cse6 (select |#memory_int| v_prenex_4))) (let ((.cse5 (select .cse6 v_prenex_2))) (and (= (+ .cse3 .cse5) .cse1) (= (+ (select .cse6 (+ v_prenex_2 (- 8))) 4) .cse5) .cse0 (not (= v_prenex_4 main_~b~0.base))))))))) [2020-07-17 22:49:06,509 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-17 22:49:08,378 WARN L193 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-17 22:49:08,400 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:08,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:08,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:08,494 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:08,498 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:08,529 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-17 22:49:08,530 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 75 treesize of output 47 [2020-07-17 22:49:08,550 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:49:08,550 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:08,556 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:08,613 INFO L350 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2020-07-17 22:49:08,617 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 53 treesize of output 43 [2020-07-17 22:49:08,622 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-07-17 22:49:08,657 INFO L624 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2020-07-17 22:49:08,661 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-17 22:49:08,662 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:7 [2020-07-17 22:49:08,673 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:08,674 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~b~0.base, main_~b~0.offset, main_~a~0.base, main_~a~0.offset, v_prenex_1, v_prenex_4, v_prenex_2]. (let ((.cse9 (select |#memory_int| main_~b~0.base))) (let ((.cse5 (select .cse9 main_~b~0.offset))) (let ((.cse3 (select .cse9 (+ main_~b~0.offset 8))) (.cse0 (= .cse5 1)) (.cse1 (= (select .cse9 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|)) (.cse2 (= 0 main_~i~0))) (or (let ((.cse4 (select |#memory_int| main_~a~0.base))) (and .cse0 .cse1 .cse2 (not (= main_~a~0.base main_~b~0.base)) (= .cse3 (+ (select .cse4 main_~a~0.offset) .cse5)) (let ((.cse6 (* v_prenex_1 8))) (= (+ (select .cse4 (+ .cse6 main_~a~0.offset (- 8))) 4) (select .cse4 (+ .cse6 main_~a~0.offset)))) (= (+ .cse5 8) .cse3))) (let ((.cse8 (select |#memory_int| v_prenex_4))) (let ((.cse7 (select .cse8 v_prenex_2))) (and (= (+ .cse5 .cse7) .cse3) (= (+ (select .cse8 (+ v_prenex_2 (- 8))) 4) .cse7) .cse0 .cse1 (not (= v_prenex_4 main_~b~0.base)) .cse2))))))) [2020-07-17 22:49:08,675 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-17 22:49:08,772 INFO L263 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2020-07-17 22:49:08,773 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-17 22:49:08,773 INFO L280 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2020-07-17 22:49:08,774 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #81#return; {1194#true} is VALID [2020-07-17 22:49:08,774 INFO L263 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret10 := main(); {1194#true} is VALID [2020-07-17 22:49:08,775 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-17 22:49:08,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {1194#true} assume !(~N~0 <= 0); {1194#true} is VALID [2020-07-17 22:49:08,775 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-17 22:49:08,775 INFO L280 TraceCheckUtils]: 8: Hoare triple {1194#true} ~cond := #in~cond; {1194#true} is VALID [2020-07-17 22:49:08,776 INFO L280 TraceCheckUtils]: 9: Hoare triple {1194#true} assume !(0 == ~cond); {1194#true} is VALID [2020-07-17 22:49:08,776 INFO L280 TraceCheckUtils]: 10: Hoare triple {1194#true} assume true; {1194#true} is VALID [2020-07-17 22:49:08,776 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1194#true} {1194#true} #77#return; {1194#true} is VALID [2020-07-17 22:49:08,783 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(8, ~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) (= 8 (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-17 22:49:08,791 INFO L280 TraceCheckUtils]: 13: Hoare triple {1235#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 8 (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(4 + #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 (= 0 (* 8 main_~i~0)) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 4) (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-17 22:49:08,793 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 (= 0 (* 8 main_~i~0)) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 4) (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 (= 0 (* 8 main_~i~0)) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 4) (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-17 22:49:08,794 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 (= 0 (* 8 main_~i~0)) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 4) (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 (= 0 (* 8 main_~i~0)) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 4) (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-17 22:49:08,798 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 (= 0 (* 8 main_~i~0)) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 4) (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) (exists ((v_prenex_1 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset)))) (= 8 (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_~a~0.base) (+ main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-17 22:49:08,818 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) (exists ((v_prenex_1 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset)))) (= 8 (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_~a~0.base) (+ main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (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~mem6;havoc #t~mem7; {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (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_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset))))) (= (+ (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 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int)) (and (= (+ (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (- 8))) 4) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (not (= v_prenex_4 main_~b~0.base))))))} is VALID [2020-07-17 22:49:08,819 INFO L280 TraceCheckUtils]: 18: Hoare triple {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (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_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset))))) (= (+ (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 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int)) (and (= (+ (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (- 8))) 4) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (not (= v_prenex_4 main_~b~0.base))))))} #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 ((v_prenex_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (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_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset))))) (= (+ (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 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int)) (and (= (+ (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (- 8))) 4) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (not (= v_prenex_4 main_~b~0.base))))))} is VALID [2020-07-17 22:49:08,820 INFO L280 TraceCheckUtils]: 19: Hoare triple {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (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_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset))))) (= (+ (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 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int)) (and (= (+ (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (- 8))) 4) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (not (= v_prenex_4 main_~b~0.base))))))} assume !(~i~0 < ~N~0); {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (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_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset))))) (= (+ (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 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int)) (and (= (+ (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (- 8))) 4) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (not (= v_prenex_4 main_~b~0.base))))))} is VALID [2020-07-17 22:49:08,821 INFO L280 TraceCheckUtils]: 20: Hoare triple {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (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_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset))))) (= (+ (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 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int)) (and (= (+ (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (- 8))) 4) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (not (= v_prenex_4 main_~b~0.base))))))} ~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)) (and (= (+ (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (- 8))) 4) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (not (= v_prenex_4 main_~b~0.base)))) (= 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_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (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_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset))))) (= (+ (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 8)))))} is VALID [2020-07-17 22:49:08,826 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)) (and (= (+ (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (- 8))) 4) (select (select |#memory_int| v_prenex_4) v_prenex_2)) (not (= v_prenex_4 main_~b~0.base)))) (= 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_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (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_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset))))) (= (+ (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 8)))))} 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-17 22:49:08,834 INFO L263 TraceCheckUtils]: 22: Hoare triple {1267#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {1271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:49:08,835 INFO L280 TraceCheckUtils]: 23: Hoare triple {1271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:49:08,835 INFO L280 TraceCheckUtils]: 24: Hoare triple {1275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1195#false} is VALID [2020-07-17 22:49:08,836 INFO L280 TraceCheckUtils]: 25: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2020-07-17 22:49:08,841 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-17 22:49:08,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002531269] [2020-07-17 22:49:08,842 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:08,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673576884] [2020-07-17 22:49:08,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:08,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 22:49:08,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518833185] [2020-07-17 22:49:08,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 22:49:08,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:08,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:49:11,009 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-17 22:49:11,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:49:11,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:49:11,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:49:11,011 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2020-07-17 22:49:19,885 WARN L193 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2020-07-17 22:49:24,496 WARN L193 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2020-07-17 22:49:31,732 WARN L193 SmtUtils]: Spent 4.66 s on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2020-07-17 22:49:36,510 WARN L193 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2020-07-17 22:49:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:41,588 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-07-17 22:49:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:49:41,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 22:49:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:49:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2020-07-17 22:49:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:49:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2020-07-17 22:49:41,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2020-07-17 22:49:44,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 69 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:44,920 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:49:44,920 INFO L226 Difference]: Without dead ends: 67 [2020-07-17 22:49:44,921 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2020-07-17 22:49:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-17 22:49:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2020-07-17 22:49:45,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:45,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 46 states. [2020-07-17 22:49:45,001 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 46 states. [2020-07-17 22:49:45,001 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 46 states. [2020-07-17 22:49:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:45,005 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-17 22:49:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-17 22:49:45,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:45,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:45,006 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 67 states. [2020-07-17 22:49:45,007 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 67 states. [2020-07-17 22:49:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:45,010 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-17 22:49:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-17 22:49:45,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:45,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:45,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:45,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:49:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2020-07-17 22:49:45,013 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 26 [2020-07-17 22:49:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:45,014 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-07-17 22:49:45,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:49:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2020-07-17 22:49:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:49:45,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:45,015 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-17 22:49:45,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:45,217 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1499578309, now seen corresponding path program 2 times [2020-07-17 22:49:45,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:45,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303873847] [2020-07-17 22:49:45,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:45,466 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-17 22:49:45,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-17 22:49:45,467 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1589#true} {1589#true} #81#return; {1589#true} is VALID [2020-07-17 22:49:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:45,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {1589#true} ~cond := #in~cond; {1589#true} is VALID [2020-07-17 22:49:45,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {1589#true} assume !(0 == ~cond); {1589#true} is VALID [2020-07-17 22:49:45,476 INFO L280 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-17 22:49:45,476 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #77#return; {1589#true} is VALID [2020-07-17 22:49:45,478 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-17 22:49:45,478 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-17 22:49:45,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-17 22:49:45,479 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #81#return; {1589#true} is VALID [2020-07-17 22:49:45,479 INFO L263 TraceCheckUtils]: 4: Hoare triple {1589#true} call #t~ret10 := main(); {1589#true} is VALID [2020-07-17 22:49:45,479 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-17 22:49:45,479 INFO L280 TraceCheckUtils]: 6: Hoare triple {1589#true} assume !(~N~0 <= 0); {1589#true} is VALID [2020-07-17 22:49:45,480 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-17 22:49:45,480 INFO L280 TraceCheckUtils]: 8: Hoare triple {1589#true} ~cond := #in~cond; {1589#true} is VALID [2020-07-17 22:49:45,480 INFO L280 TraceCheckUtils]: 9: Hoare triple {1589#true} assume !(0 == ~cond); {1589#true} is VALID [2020-07-17 22:49:45,481 INFO L280 TraceCheckUtils]: 10: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-17 22:49:45,481 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1589#true} {1589#true} #77#return; {1589#true} is VALID [2020-07-17 22:49:45,482 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(8, ~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-17 22:49:45,483 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {1598#(= 1 main_~i~0)} is VALID [2020-07-17 22:49:45,485 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-17 22:49:45,486 INFO L280 TraceCheckUtils]: 15: Hoare triple {1599#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {1600#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,487 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-17 22:49:45,490 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~mem6;havoc #t~mem7; {1601#(and (<= ~N~0 2) (= 1 main_~i~0))} is VALID [2020-07-17 22:49:45,491 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-17 22:49:45,492 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~mem6;havoc #t~mem7; {1590#false} is VALID [2020-07-17 22:49:45,492 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-17 22:49:45,492 INFO L280 TraceCheckUtils]: 21: Hoare triple {1590#false} assume !(~i~0 < ~N~0); {1590#false} is VALID [2020-07-17 22:49:45,493 INFO L280 TraceCheckUtils]: 22: Hoare triple {1590#false} ~i~0 := 0; {1590#false} is VALID [2020-07-17 22:49:45,493 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-17 22:49:45,493 INFO L263 TraceCheckUtils]: 24: Hoare triple {1590#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {1590#false} is VALID [2020-07-17 22:49:45,494 INFO L280 TraceCheckUtils]: 25: Hoare triple {1590#false} ~cond := #in~cond; {1590#false} is VALID [2020-07-17 22:49:45,494 INFO L280 TraceCheckUtils]: 26: Hoare triple {1590#false} assume 0 == ~cond; {1590#false} is VALID [2020-07-17 22:49:45,494 INFO L280 TraceCheckUtils]: 27: Hoare triple {1590#false} assume !false; {1590#false} is VALID [2020-07-17 22:49:45,495 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-17 22:49:45,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303873847] [2020-07-17 22:49:45,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117889662] [2020-07-17 22:49:45,496 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-17 22:49:45,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:49:45,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:49:45,542 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:49:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:45,556 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:45,698 INFO L263 TraceCheckUtils]: 0: Hoare triple {1589#true} call ULTIMATE.init(); {1589#true} is VALID [2020-07-17 22:49:45,699 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-17 22:49:45,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-17 22:49:45,699 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #81#return; {1589#true} is VALID [2020-07-17 22:49:45,699 INFO L263 TraceCheckUtils]: 4: Hoare triple {1589#true} call #t~ret10 := main(); {1589#true} is VALID [2020-07-17 22:49:45,700 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-17 22:49:45,700 INFO L280 TraceCheckUtils]: 6: Hoare triple {1589#true} assume !(~N~0 <= 0); {1589#true} is VALID [2020-07-17 22:49:45,700 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-17 22:49:45,700 INFO L280 TraceCheckUtils]: 8: Hoare triple {1589#true} ~cond := #in~cond; {1589#true} is VALID [2020-07-17 22:49:45,700 INFO L280 TraceCheckUtils]: 9: Hoare triple {1589#true} assume !(0 == ~cond); {1589#true} is VALID [2020-07-17 22:49:45,701 INFO L280 TraceCheckUtils]: 10: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-17 22:49:45,701 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1589#true} {1589#true} #77#return; {1589#true} is VALID [2020-07-17 22:49:45,703 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(8, ~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-17 22:49:45,704 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {1643#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:45,709 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-17 22:49:45,711 INFO L280 TraceCheckUtils]: 15: Hoare triple {1599#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {1600#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,711 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-17 22:49:45,713 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~mem6;havoc #t~mem7; {1656#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:45,718 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-17 22:49:45,720 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~mem6;havoc #t~mem7; {1590#false} is VALID [2020-07-17 22:49:45,721 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-17 22:49:45,721 INFO L280 TraceCheckUtils]: 21: Hoare triple {1590#false} assume !(~i~0 < ~N~0); {1590#false} is VALID [2020-07-17 22:49:45,721 INFO L280 TraceCheckUtils]: 22: Hoare triple {1590#false} ~i~0 := 0; {1590#false} is VALID [2020-07-17 22:49:45,721 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-17 22:49:45,721 INFO L263 TraceCheckUtils]: 24: Hoare triple {1590#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {1590#false} is VALID [2020-07-17 22:49:45,721 INFO L280 TraceCheckUtils]: 25: Hoare triple {1590#false} ~cond := #in~cond; {1590#false} is VALID [2020-07-17 22:49:45,722 INFO L280 TraceCheckUtils]: 26: Hoare triple {1590#false} assume 0 == ~cond; {1590#false} is VALID [2020-07-17 22:49:45,722 INFO L280 TraceCheckUtils]: 27: Hoare triple {1590#false} assume !false; {1590#false} is VALID [2020-07-17 22:49:45,723 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-17 22:49:45,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:49:45,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-17 22:49:45,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238169037] [2020-07-17 22:49:45,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:49:45,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:45,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:49:45,820 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-17 22:49:45,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:49:45,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:45,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:49:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:49:45,822 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 11 states. [2020-07-17 22:49:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:47,441 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-07-17 22:49:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:49:47,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:49:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:49:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2020-07-17 22:49:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:49:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2020-07-17 22:49:47,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 87 transitions. [2020-07-17 22:49:47,699 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-17 22:49:47,701 INFO L225 Difference]: With dead ends: 84 [2020-07-17 22:49:47,702 INFO L226 Difference]: Without dead ends: 71 [2020-07-17 22:49:47,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:49:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-17 22:49:47,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2020-07-17 22:49:47,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:47,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 45 states. [2020-07-17 22:49:47,777 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 45 states. [2020-07-17 22:49:47,777 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 45 states. [2020-07-17 22:49:47,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:47,781 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-17 22:49:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-17 22:49:47,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:47,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:47,782 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 71 states. [2020-07-17 22:49:47,782 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 71 states. [2020-07-17 22:49:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:47,786 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-17 22:49:47,786 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-17 22:49:47,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:47,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:47,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:47,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 22:49:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-17 22:49:47,789 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 28 [2020-07-17 22:49:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:47,790 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-17 22:49:47,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:49:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-17 22:49:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:49:47,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:47,791 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-17 22:49:48,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:49:48,005 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:48,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1048027141, now seen corresponding path program 3 times [2020-07-17 22:49:48,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:48,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862604915] [2020-07-17 22:49:48,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:48,160 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-17 22:49:48,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-17 22:49:48,161 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2026#true} {2026#true} #81#return; {2026#true} is VALID [2020-07-17 22:49:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:48,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2020-07-17 22:49:48,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2020-07-17 22:49:48,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-17 22:49:48,178 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #77#return; {2026#true} is VALID [2020-07-17 22:49:48,181 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-17 22:49:48,181 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-17 22:49:48,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-17 22:49:48,182 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #81#return; {2026#true} is VALID [2020-07-17 22:49:48,182 INFO L263 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret10 := main(); {2026#true} is VALID [2020-07-17 22:49:48,182 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-17 22:49:48,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {2026#true} assume !(~N~0 <= 0); {2026#true} is VALID [2020-07-17 22:49:48,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-17 22:49:48,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2020-07-17 22:49:48,183 INFO L280 TraceCheckUtils]: 9: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2020-07-17 22:49:48,184 INFO L280 TraceCheckUtils]: 10: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-17 22:49:48,184 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2026#true} {2026#true} #77#return; {2026#true} is VALID [2020-07-17 22:49:48,190 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(8, ~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-17 22:49:48,191 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2035#(= 1 main_~i~0)} is VALID [2020-07-17 22:49:48,192 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-17 22:49:48,193 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2037#(<= 3 ~N~0)} is VALID [2020-07-17 22:49:48,194 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-17 22:49:48,194 INFO L280 TraceCheckUtils]: 17: Hoare triple {2037#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {2037#(<= 3 ~N~0)} is VALID [2020-07-17 22:49:48,195 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-17 22:49:48,197 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~mem6;havoc #t~mem7; {2038#(and (<= 3 ~N~0) (= 1 main_~i~0))} is VALID [2020-07-17 22:49:48,199 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-17 22:49:48,200 INFO L280 TraceCheckUtils]: 21: Hoare triple {2039#(<= (+ main_~i~0 1) ~N~0)} assume !(~i~0 < ~N~0); {2027#false} is VALID [2020-07-17 22:49:48,200 INFO L280 TraceCheckUtils]: 22: Hoare triple {2027#false} ~i~0 := 0; {2027#false} is VALID [2020-07-17 22:49:48,200 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-17 22:49:48,201 INFO L263 TraceCheckUtils]: 24: Hoare triple {2027#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {2027#false} is VALID [2020-07-17 22:49:48,201 INFO L280 TraceCheckUtils]: 25: Hoare triple {2027#false} ~cond := #in~cond; {2027#false} is VALID [2020-07-17 22:49:48,201 INFO L280 TraceCheckUtils]: 26: Hoare triple {2027#false} assume 0 == ~cond; {2027#false} is VALID [2020-07-17 22:49:48,201 INFO L280 TraceCheckUtils]: 27: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2020-07-17 22:49:48,202 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-17 22:49:48,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862604915] [2020-07-17 22:49:48,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570160845] [2020-07-17 22:49:48,203 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-17 22:49:48,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:49:48,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:49:48,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:49:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:48,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:48,392 INFO L263 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2020-07-17 22:49:48,393 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-17 22:49:48,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-17 22:49:48,393 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #81#return; {2026#true} is VALID [2020-07-17 22:49:48,393 INFO L263 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret10 := main(); {2026#true} is VALID [2020-07-17 22:49:48,394 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-17 22:49:48,394 INFO L280 TraceCheckUtils]: 6: Hoare triple {2026#true} assume !(~N~0 <= 0); {2026#true} is VALID [2020-07-17 22:49:48,394 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-17 22:49:48,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2020-07-17 22:49:48,395 INFO L280 TraceCheckUtils]: 9: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2020-07-17 22:49:48,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-17 22:49:48,395 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2026#true} {2026#true} #77#return; {2026#true} is VALID [2020-07-17 22:49:48,397 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(8, ~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-17 22:49:48,398 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2080#(<= 1 main_~i~0)} is VALID [2020-07-17 22:49:48,402 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-17 22:49:48,405 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2037#(<= 3 ~N~0)} is VALID [2020-07-17 22:49:48,406 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-17 22:49:48,406 INFO L280 TraceCheckUtils]: 17: Hoare triple {2037#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {2037#(<= 3 ~N~0)} is VALID [2020-07-17 22:49:48,407 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-17 22:49:48,409 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~mem6;havoc #t~mem7; {2099#(and (<= 3 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:49:48,415 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-17 22:49:48,416 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-17 22:49:48,416 INFO L280 TraceCheckUtils]: 22: Hoare triple {2027#false} ~i~0 := 0; {2027#false} is VALID [2020-07-17 22:49:48,416 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-17 22:49:48,417 INFO L263 TraceCheckUtils]: 24: Hoare triple {2027#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {2027#false} is VALID [2020-07-17 22:49:48,417 INFO L280 TraceCheckUtils]: 25: Hoare triple {2027#false} ~cond := #in~cond; {2027#false} is VALID [2020-07-17 22:49:48,417 INFO L280 TraceCheckUtils]: 26: Hoare triple {2027#false} assume 0 == ~cond; {2027#false} is VALID [2020-07-17 22:49:48,417 INFO L280 TraceCheckUtils]: 27: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2020-07-17 22:49:48,419 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-17 22:49:48,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:49:48,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-17 22:49:48,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517098179] [2020-07-17 22:49:48,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:49:48,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:48,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:49:48,503 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-17 22:49:48,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:49:48,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:48,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:49:48,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:49:48,504 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 11 states. [2020-07-17 22:49:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:50,325 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-07-17 22:49:50,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 22:49:50,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:49:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:49:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2020-07-17 22:49:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:49:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2020-07-17 22:49:50,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2020-07-17 22:49:50,557 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-17 22:49:50,559 INFO L225 Difference]: With dead ends: 79 [2020-07-17 22:49:50,559 INFO L226 Difference]: Without dead ends: 68 [2020-07-17 22:49:50,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:49:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-17 22:49:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-07-17 22:49:50,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:50,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 47 states. [2020-07-17 22:49:50,634 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 47 states. [2020-07-17 22:49:50,634 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 47 states. [2020-07-17 22:49:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:50,637 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-17 22:49:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-07-17 22:49:50,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:50,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:50,638 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 68 states. [2020-07-17 22:49:50,638 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 68 states. [2020-07-17 22:49:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:50,642 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-17 22:49:50,642 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-07-17 22:49:50,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:50,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:50,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:50,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 22:49:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-17 22:49:50,645 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 28 [2020-07-17 22:49:50,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:50,646 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-17 22:49:50,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:49:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-17 22:49:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:49:50,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:50,647 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-17 22:49:50,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:50,862 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:50,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-17 22:49:50,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:50,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806753013] [2020-07-17 22:49:50,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:50,876 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:50,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619999702] [2020-07-17 22:49:50,877 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-17 22:49:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:50,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:49:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:50,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:51,040 INFO L263 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2020-07-17 22:49:51,041 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-17 22:49:51,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2020-07-17 22:49:51,041 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #81#return; {2452#true} is VALID [2020-07-17 22:49:51,041 INFO L263 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret10 := main(); {2452#true} is VALID [2020-07-17 22:49:51,042 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-17 22:49:51,042 INFO L280 TraceCheckUtils]: 6: Hoare triple {2452#true} assume !(~N~0 <= 0); {2452#true} is VALID [2020-07-17 22:49:51,042 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-17 22:49:51,042 INFO L280 TraceCheckUtils]: 8: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2020-07-17 22:49:51,043 INFO L280 TraceCheckUtils]: 9: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2020-07-17 22:49:51,043 INFO L280 TraceCheckUtils]: 10: Hoare triple {2452#true} assume true; {2452#true} is VALID [2020-07-17 22:49:51,043 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2452#true} {2452#true} #77#return; {2452#true} is VALID [2020-07-17 22:49:51,046 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(8, ~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-17 22:49:51,051 INFO L280 TraceCheckUtils]: 13: Hoare triple {2493#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {2497#(<= ~N~0 1)} is VALID [2020-07-17 22:49:51,052 INFO L280 TraceCheckUtils]: 14: Hoare triple {2497#(<= ~N~0 1)} ~i~0 := 1; {2497#(<= ~N~0 1)} is VALID [2020-07-17 22:49:51,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {2497#(<= ~N~0 1)} assume !(~i~0 < ~N~0); {2497#(<= ~N~0 1)} is VALID [2020-07-17 22:49:51,056 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-17 22:49:51,057 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-17 22:49:51,059 INFO L263 TraceCheckUtils]: 18: Hoare triple {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {2497#(<= ~N~0 1)} is VALID [2020-07-17 22:49:51,059 INFO L280 TraceCheckUtils]: 19: Hoare triple {2497#(<= ~N~0 1)} ~cond := #in~cond; {2497#(<= ~N~0 1)} is VALID [2020-07-17 22:49:51,060 INFO L280 TraceCheckUtils]: 20: Hoare triple {2497#(<= ~N~0 1)} assume !(0 == ~cond); {2497#(<= ~N~0 1)} is VALID [2020-07-17 22:49:51,061 INFO L280 TraceCheckUtils]: 21: Hoare triple {2497#(<= ~N~0 1)} assume true; {2497#(<= ~N~0 1)} is VALID [2020-07-17 22:49:51,062 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-17 22:49:51,063 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-17 22:49:51,069 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-17 22:49:51,071 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-17 22:49:51,071 INFO L263 TraceCheckUtils]: 26: Hoare triple {2453#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {2453#false} is VALID [2020-07-17 22:49:51,071 INFO L280 TraceCheckUtils]: 27: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2020-07-17 22:49:51,072 INFO L280 TraceCheckUtils]: 28: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2020-07-17 22:49:51,072 INFO L280 TraceCheckUtils]: 29: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2020-07-17 22:49:51,073 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-17 22:49:51,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806753013] [2020-07-17 22:49:51,074 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:51,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619999702] [2020-07-17 22:49:51,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:51,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:49:51,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007541094] [2020-07-17 22:49:51,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-17 22:49:51,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:51,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:49:51,145 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-17 22:49:51,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:49:51,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:51,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:49:51,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:49:51,147 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2020-07-17 22:49:51,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:51,716 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-17 22:49:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:49:51,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-17 22:49:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:49:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-17 22:49:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:49:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-17 22:49:51,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2020-07-17 22:49:51,893 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-17 22:49:51,894 INFO L225 Difference]: With dead ends: 72 [2020-07-17 22:49:51,895 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 22:49:51,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:49:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 22:49:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2020-07-17 22:49:52,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:52,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 46 states. [2020-07-17 22:49:52,002 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 46 states. [2020-07-17 22:49:52,003 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 46 states. [2020-07-17 22:49:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:52,006 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-17 22:49:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-17 22:49:52,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:52,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:52,007 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 50 states. [2020-07-17 22:49:52,007 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 50 states. [2020-07-17 22:49:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:52,008 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-17 22:49:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-17 22:49:52,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:52,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:52,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:52,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:49:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-07-17 22:49:52,011 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 30 [2020-07-17 22:49:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:52,011 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-07-17 22:49:52,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:49:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-07-17 22:49:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:49:52,011 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:52,011 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-17 22:49:52,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:52,213 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:52,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 4 times [2020-07-17 22:49:52,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:52,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601366435] [2020-07-17 22:49:52,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:52,251 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:52,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257728198] [2020-07-17 22:49:52,252 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-17 22:49:52,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:49:52,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:49:52,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-17 22:49:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:52,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:52,371 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-17 22:49:52,372 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:52,394 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:52,404 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-17 22:49:52,404 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:52,436 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:52,437 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-17 22:49:52,437 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-17 22:49:52,450 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:52,450 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, |v_#valid_11|]. (and (= |#memory_int| (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 8)))) (store .cse0 main_~b~0.base (store (select .cse0 main_~b~0.base) main_~b~0.offset 1)))) (= 0 (select (store |v_#valid_11| main_~a~0.base 1) main_~b~0.base))) [2020-07-17 22:49:52,450 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) [2020-07-17 22:49:52,632 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2020-07-17 22:49:52,633 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-17 22:49:52,634 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-17 22:49:52,648 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:52,756 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-07-17 22:49:52,758 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-17 22:49:52,761 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:52,764 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-17 22:49:52,765 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-17 22:49:52,805 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:52,806 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)) (= 8 (select .cse0 main_~a~0.offset)) (= (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))) 4)))) |#memory_int|) (not (= main_~a~0.base main_~b~0.base)))) [2020-07-17 22:49:52,806 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) (not (= main_~a~0.base main_~b~0.base)) (or (= main_~a~0.offset .cse0) (= 8 (select .cse1 main_~a~0.offset))) (= (+ (select .cse1 (+ .cse2 main_~a~0.offset (- 8))) 4) (select .cse1 .cse0))))) [2020-07-17 22:49:52,808 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:52,891 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:53,001 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:53,006 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:53,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:53,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:53,209 INFO L244 Elim1Store]: Index analysis took 144 ms [2020-07-17 22:49:53,571 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-17 22:49:53,572 INFO L350 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2020-07-17 22:49:53,572 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-17 22:49:53,594 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-17 22:49:53,595 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:49:53,605 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-17 22:49:53,606 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:49:53,618 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-17 22:49:53,619 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:49:53,629 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-17 22:49:53,630 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:49:53,636 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:49:53,636 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:53,661 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:53,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:53,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:53,796 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:53,796 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-17 22:49:53,813 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-17 22:49:53,813 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:49:53,818 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-17 22:49:53,819 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:49:53,822 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:49:53,822 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:53,831 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:54,536 WARN L193 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 44 [2020-07-17 22:49:54,537 INFO L624 ElimStorePlain]: treesize reduction 775, result has 14.9 percent of original size [2020-07-17 22:49:54,550 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:54,555 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-17 22:49:54,555 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:101 [2020-07-17 22:49:54,623 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:54,624 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, main_~i~0, v_prenex_5]. (let ((.cse2 (select |v_#memory_int_17| main_~a~0.base))) (let ((.cse1 (= 1 (select (select |v_#memory_int_17| main_~b~0.base) main_~b~0.offset))) (.cse4 (= (store |v_#memory_int_17| main_~a~0.base (let ((.cse6 (* main_~i~0 8))) (store .cse2 (+ .cse6 main_~a~0.offset) (+ (select .cse2 (+ .cse6 main_~a~0.offset (- 8))) 4)))) |#memory_int|)) (.cse0 (select .cse2 main_~a~0.offset)) (.cse5 (not (= main_~a~0.base main_~b~0.base)))) (or (and (= 8 .cse0) .cse1 (let ((.cse3 (* v_prenex_5 8))) (= (+ (select .cse2 (+ .cse3 main_~a~0.offset (- 8))) 4) (select .cse2 (+ .cse3 main_~a~0.offset)))) .cse4 .cse5) (and .cse1 .cse4 (= (+ (select .cse2 (+ main_~a~0.offset (- 8))) 4) .cse0) .cse5)))) [2020-07-17 22:49:54,624 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_6, main_~i~0]. (let ((.cse1 (select |#memory_int| main_~a~0.base))) (let ((.cse0 (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (.cse3 (select .cse1 main_~a~0.offset)) (.cse5 (not (= main_~a~0.base main_~b~0.base)))) (or (let ((.cse6 (* v_prenex_6 8))) (let ((.cse4 (+ .cse6 main_~a~0.offset))) (and .cse0 (let ((.cse2 (+ main_~a~0.offset (- 8)))) (or (= (+ (select .cse1 .cse2) 4) .cse3) (= .cse2 .cse4))) .cse5 (= (+ (select .cse1 (+ .cse6 main_~a~0.offset (- 8))) 4) (select .cse1 .cse4))))) (and .cse0 (= 8 .cse3) .cse5 (let ((.cse7 (* main_~i~0 8))) (= (+ (select .cse1 (+ .cse7 main_~a~0.offset (- 8))) 4) (select .cse1 (+ .cse7 main_~a~0.offset)))))))) [2020-07-17 22:49:54,626 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:54,843 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-07-17 22:49:54,857 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:55,017 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:55,143 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:55,591 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-07-17 22:49:55,604 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:49:55,675 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:55,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:55,684 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:55,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:55,693 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:55,740 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:55,783 INFO L244 Elim1Store]: Index analysis took 108 ms [2020-07-17 22:49:55,789 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-17 22:49:55,794 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:55,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:55,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:55,856 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:55,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:55,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:55,961 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:56,039 INFO L244 Elim1Store]: Index analysis took 199 ms [2020-07-17 22:49:56,046 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-17 22:49:56,059 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:56,089 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:56,090 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:56,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:56,133 INFO L350 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2020-07-17 22:49:56,134 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-17 22:49:56,145 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:56,716 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-07-17 22:49:56,717 INFO L624 ElimStorePlain]: treesize reduction 53, result has 78.5 percent of original size [2020-07-17 22:49:56,718 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-17 22:49:56,718 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:212, output treesize:194 [2020-07-17 22:49:57,185 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-17 22:49:57,210 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-07-17 22:49:57,210 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:49:57,669 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-07-17 22:49:57,688 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:49:57,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:57,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:57,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:57,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:58,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:58,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:58,255 INFO L244 Elim1Store]: Index analysis took 333 ms [2020-07-17 22:49:58,454 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-07-17 22:49:58,455 INFO L350 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2020-07-17 22:49:58,455 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 89 treesize of output 175 [2020-07-17 22:49:58,468 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:58,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:58,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:58,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:58,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:58,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:58,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:58,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:58,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,030 INFO L244 Elim1Store]: Index analysis took 483 ms [2020-07-17 22:49:59,061 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:59,061 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 75 treesize of output 98 [2020-07-17 22:49:59,072 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:59,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:59,205 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:59,206 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-17 22:49:59,215 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:59,818 WARN L193 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2020-07-17 22:49:59,820 INFO L624 ElimStorePlain]: treesize reduction 210, result has 53.4 percent of original size [2020-07-17 22:49:59,882 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-17 22:49:59,882 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:261, output treesize:241 [2020-07-17 22:49:59,969 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:59,970 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 ((.cse10 (select |v_#memory_int_19| main_~b~0.base))) (let ((.cse5 (select |v_#memory_int_19| main_~a~0.base)) (.cse2 (select .cse10 main_~b~0.offset))) (let ((.cse0 (<= 2 main_~i~0)) (.cse8 (= 1 .cse2)) (.cse4 (= (store |v_#memory_int_19| main_~b~0.base (let ((.cse11 (* main_~i~0 8))) (store .cse10 (+ main_~b~0.offset .cse11) (+ (select .cse5 (+ .cse11 main_~a~0.offset (- 8))) (select .cse10 (+ main_~b~0.offset .cse11 (- 8))))))) |#memory_int|)) (.cse9 (select .cse5 (+ main_~a~0.offset (- 8)))) (.cse7 (not (= main_~a~0.base main_~b~0.base))) (.cse1 (select .cse10 (+ main_~b~0.offset 8))) (.cse3 (select .cse5 main_~a~0.offset))) (or (and .cse0 (= .cse1 (+ .cse2 8)) (= 8 .cse3) .cse4 (= 9 .cse1) (let ((.cse6 (* v_prenex_7 8))) (= (+ (select .cse5 (+ .cse6 main_~a~0.offset (- 8))) 4) (select .cse5 (+ .cse6 main_~a~0.offset)))) .cse7) (and .cse0 .cse8 (= .cse1 (+ .cse9 5)) .cse4 (= (+ .cse9 4) .cse3) .cse7) (and .cse0 .cse8 .cse4 (= (+ (select .cse5 (+ main_~a~0.offset (- 16))) 4) .cse9) .cse7 (= .cse1 (+ .cse3 1))))))) [2020-07-17 22:49:59,970 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 ((.cse3 (= (select .cse0 main_~b~0.offset) 1)) (.cse5 (select .cse0 (+ main_~b~0.offset 8)))) (or (let ((.cse2 (select |#memory_int| v_prenex_10))) (and (<= 2 v_prenex_8) (let ((.cse1 (* v_prenex_8 8))) (= (select .cse0 (+ main_~b~0.offset .cse1)) (+ (select .cse0 (+ main_~b~0.offset .cse1 (- 8))) (select .cse2 (+ .cse1 v_prenex_9 (- 8)))))) .cse3 (let ((.cse4 (* v_prenex_7 8))) (= (+ (select .cse2 (+ .cse4 v_prenex_9 (- 8))) 4) (select .cse2 (+ .cse4 v_prenex_9)))) (= 9 .cse5) (= 8 (select .cse2 v_prenex_9)) (not (= v_prenex_10 main_~b~0.base)))) (let ((.cse7 (select |#memory_int| main_~a~0.base))) (and (<= 2 main_~i~0) (let ((.cse6 (* main_~i~0 8))) (= (select .cse0 (+ main_~b~0.offset .cse6)) (+ (select .cse0 (+ main_~b~0.offset .cse6 (- 8))) (select .cse7 (+ .cse6 main_~a~0.offset (- 8)))))) .cse3 (= (+ (select .cse7 main_~a~0.offset) 1) .cse5) (not (= main_~a~0.base main_~b~0.base)) (= (select .cse7 (+ main_~a~0.offset (- 8))) (+ (select .cse7 (+ main_~a~0.offset (- 16))) 4)))) (let ((.cse9 (select |#memory_int| v_prenex_13))) (and (<= 2 v_prenex_11) (let ((.cse8 (* v_prenex_11 8))) (= (select .cse0 (+ main_~b~0.offset .cse8)) (+ (select .cse0 (+ main_~b~0.offset .cse8 (- 8))) (select .cse9 (+ .cse8 v_prenex_12 (- 8)))))) .cse3 (= (+ (select .cse9 v_prenex_12) 1) .cse5) (= (+ (select .cse9 (+ v_prenex_12 (- 8))) 5) .cse5) (not (= v_prenex_13 main_~b~0.base))))))) [2020-07-17 22:50:04,514 WARN L193 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 101 [2020-07-17 22:50:13,086 WARN L193 SmtUtils]: Spent 2.38 s on a formula simplification that was a NOOP. DAG size: 104 [2020-07-17 22:50:13,114 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:50:13,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,370 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:13,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,394 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:13,714 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-17 22:50:13,715 INFO L350 Elim1Store]: treesize reduction 17, result has 84.0 percent of original size [2020-07-17 22:50:13,716 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-17 22:50:13,743 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-17 22:50:13,744 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:13,747 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:50:13,748 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:13,762 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:13,766 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:13,769 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:50:13,770 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:13,775 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-17 22:50:13,776 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:13,781 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:50:13,781 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:13,817 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-17 22:50:13,818 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:13,822 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:50:13,823 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:13,845 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:13,852 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:13,854 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:50:13,856 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:13,862 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-17 22:50:13,863 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:13,868 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:50:13,868 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:13,882 INFO L544 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-17 22:50:13,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,968 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:13,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:13,981 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:14,128 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-07-17 22:50:14,129 INFO L350 Elim1Store]: treesize reduction 10, result has 81.5 percent of original size [2020-07-17 22:50:14,130 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 82 treesize of output 65 [2020-07-17 22:50:14,144 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:50:14,145 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:14,160 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:50:14,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:14,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:14,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:14,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:14,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:14,241 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:14,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:14,454 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-07-17 22:50:14,454 INFO L350 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2020-07-17 22:50:14,455 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-17 22:50:14,482 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:50:14,482 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:14,486 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:50:15,164 WARN L193 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2020-07-17 22:50:15,166 INFO L624 ElimStorePlain]: treesize reduction 68, result has 65.7 percent of original size [2020-07-17 22:50:15,187 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-17 22:50:15,187 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:283, output treesize:7 [2020-07-17 22:50:15,250 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:15,251 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, v_prenex_11, v_prenex_13, v_prenex_12, main_~a~0.base, v_prenex_14, main_~a~0.offset]. (let ((.cse6 (select |#memory_int| main_~b~0.base))) (let ((.cse0 (= (select .cse6 main_~b~0.offset) 1)) (.cse3 (select .cse6 (+ main_~b~0.offset 8))) (.cse1 (= (select .cse6 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|)) (.cse2 (= 0 main_~i~0))) (or (let ((.cse4 (select |#memory_int| v_prenex_10))) (and (not (= v_prenex_10 main_~b~0.base)) .cse0 .cse1 .cse2 (= 9 .cse3) (let ((.cse5 (* v_prenex_7 8))) (= (+ (select .cse4 (+ .cse5 v_prenex_9 (- 8))) 4) (select .cse4 (+ .cse5 v_prenex_9)))) (= 8 (select .cse4 v_prenex_9)) (let ((.cse7 (* v_prenex_8 8))) (= (select .cse6 (+ main_~b~0.offset .cse7)) (+ (select .cse4 (+ .cse7 v_prenex_9 (- 8))) (select .cse6 (+ main_~b~0.offset .cse7 (- 8)))))) (<= 2 v_prenex_8))) (let ((.cse8 (select |#memory_int| v_prenex_13))) (and (not (= v_prenex_13 main_~b~0.base)) .cse0 (= (+ (select .cse8 (+ v_prenex_12 (- 8))) 5) .cse3) (<= 2 v_prenex_11) (= (+ (select .cse8 v_prenex_12) 1) .cse3) .cse1 (let ((.cse9 (* v_prenex_11 8))) (= (select .cse6 (+ main_~b~0.offset .cse9)) (+ (select .cse6 (+ main_~b~0.offset .cse9 (- 8))) (select .cse8 (+ .cse9 v_prenex_12 (- 8)))))) .cse2)) (let ((.cse10 (select |#memory_int| main_~a~0.base))) (and .cse0 (= (+ (select .cse10 main_~a~0.offset) 1) .cse3) .cse1 .cse2 (not (= main_~a~0.base main_~b~0.base)) (let ((.cse11 (* v_prenex_14 8))) (= (select .cse6 (+ main_~b~0.offset .cse11)) (+ (select .cse10 (+ .cse11 main_~a~0.offset (- 8))) (select .cse6 (+ main_~b~0.offset .cse11 (- 8)))))) (= (select .cse10 (+ main_~a~0.offset (- 8))) (+ (select .cse10 (+ main_~a~0.offset (- 16))) 4)) (<= 2 v_prenex_14)))))) [2020-07-17 22:50:15,251 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-17 22:50:15,628 INFO L263 TraceCheckUtils]: 0: Hoare triple {2821#true} call ULTIMATE.init(); {2821#true} is VALID [2020-07-17 22:50:15,629 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-17 22:50:15,629 INFO L280 TraceCheckUtils]: 2: Hoare triple {2821#true} assume true; {2821#true} is VALID [2020-07-17 22:50:15,629 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2821#true} {2821#true} #81#return; {2821#true} is VALID [2020-07-17 22:50:15,630 INFO L263 TraceCheckUtils]: 4: Hoare triple {2821#true} call #t~ret10 := main(); {2821#true} is VALID [2020-07-17 22:50:15,630 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-17 22:50:15,630 INFO L280 TraceCheckUtils]: 6: Hoare triple {2821#true} assume !(~N~0 <= 0); {2821#true} is VALID [2020-07-17 22:50:15,630 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-17 22:50:15,631 INFO L280 TraceCheckUtils]: 8: Hoare triple {2821#true} ~cond := #in~cond; {2821#true} is VALID [2020-07-17 22:50:15,631 INFO L280 TraceCheckUtils]: 9: Hoare triple {2821#true} assume !(0 == ~cond); {2821#true} is VALID [2020-07-17 22:50:15,631 INFO L280 TraceCheckUtils]: 10: Hoare triple {2821#true} assume true; {2821#true} is VALID [2020-07-17 22:50:15,631 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2821#true} {2821#true} #77#return; {2821#true} is VALID [2020-07-17 22:50:15,639 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(8, ~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) (= 8 (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-17 22:50:15,665 INFO L280 TraceCheckUtils]: 13: Hoare triple {2862#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 8 (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(4 + #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 (= 0 (* 8 main_~i~0)) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 4) (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-17 22:50:15,666 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 (= 0 (* 8 main_~i~0)) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 4) (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 (= 0 (* 8 main_~i~0)) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 4) (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-17 22:50:15,768 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 (= 0 (* 8 main_~i~0)) (= 8 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 4) (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(4 + #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) (not (= main_~a~0.base main_~b~0.base)) (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 (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset)))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 8 (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))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))))} is VALID [2020-07-17 22:50:15,769 INFO L280 TraceCheckUtils]: 16: Hoare triple {2873#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~a~0.base main_~b~0.base)) (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 (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset)))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 8 (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))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))))} #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) (not (= main_~a~0.base main_~b~0.base)) (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 (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset)))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 8 (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))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))))} is VALID [2020-07-17 22:50:15,770 INFO L280 TraceCheckUtils]: 17: Hoare triple {2873#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~a~0.base main_~b~0.base)) (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 (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset)))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 8 (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))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))))} assume !(~i~0 < ~N~0); {2873#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~a~0.base main_~b~0.base)) (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 (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset)))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 8 (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))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))))} is VALID [2020-07-17 22:50:15,792 INFO L280 TraceCheckUtils]: 18: Hoare triple {2873#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~a~0.base main_~b~0.base)) (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 (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset)))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 8 (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))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))))} ~i~0 := 1; {2883#(or (and (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (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) (not (= main_~a~0.base main_~b~0.base)) (= (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))) 4))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)))) (= 1 main_~i~0) (= 8 (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-17 22:50:15,831 INFO L280 TraceCheckUtils]: 19: Hoare triple {2883#(or (and (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (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) (not (= main_~a~0.base main_~b~0.base)) (= (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))) 4))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)))) (= 1 main_~i~0) (= 8 (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~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~mem6;havoc #t~mem7; {2887#(or (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) 9) (= 8 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (exists ((v_prenex_7 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)))) (= 1 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))) 8)) (not (= main_~a~0.base main_~b~0.base))) (and (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (= (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_~a~0.offset (- 8))) 5)) (= 1 main_~i~0) (= 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)) (= 1 main_~i~0) (= 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)) (= (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))) 4))))} is VALID [2020-07-17 22:50:15,859 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))) 9) (= 8 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (exists ((v_prenex_7 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)))) (= 1 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))) 8)) (not (= main_~a~0.base main_~b~0.base))) (and (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (= (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_~a~0.offset (- 8))) 5)) (= 1 main_~i~0) (= 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)) (= 1 main_~i~0) (= 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)) (= (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))) 4))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2891#(or (and (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= 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 (- 8))) 5) (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) (exists ((v_prenex_7 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)))) (= 9 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= 8 (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_~b~0.base) (+ main_~b~0.offset 8)))) (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))) (not (= main_~a~0.base main_~b~0.base)) (= (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))) 4))))} is VALID [2020-07-17 22:50:17,878 INFO L280 TraceCheckUtils]: 21: Hoare triple {2891#(or (and (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= 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 (- 8))) 5) (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) (exists ((v_prenex_7 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 4) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)))) (= 9 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= 8 (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_~b~0.base) (+ main_~b~0.offset 8)))) (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))) (not (= main_~a~0.base main_~b~0.base)) (= (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))) 4))))} 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~mem6;havoc #t~mem7; {2895#(or (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)) (= (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) 5) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (<= 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)))))))) (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) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)) (= (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))) 4)))) (= (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 (- 8))) 4) (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9))) (= 8 (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))) (= 9 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} is UNKNOWN [2020-07-17 22:50:17,880 INFO L280 TraceCheckUtils]: 22: Hoare triple {2895#(or (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)) (= (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) 5) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (<= 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)))))))) (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) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)) (= (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))) 4)))) (= (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 (- 8))) 4) (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9))) (= 8 (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))) (= 9 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2895#(or (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)) (= (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) 5) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (<= 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)))))))) (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) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)) (= (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))) 4)))) (= (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 (- 8))) 4) (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9))) (= 8 (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))) (= 9 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} is VALID [2020-07-17 22:50:17,881 INFO L280 TraceCheckUtils]: 23: Hoare triple {2895#(or (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)) (= (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) 5) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (<= 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)))))))) (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) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)) (= (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))) 4)))) (= (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 (- 8))) 4) (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9))) (= 8 (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))) (= 9 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} assume !(~i~0 < ~N~0); {2895#(or (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)) (= (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) 5) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (<= 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)))))))) (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) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)) (= (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))) 4)))) (= (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 (- 8))) 4) (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9))) (= 8 (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))) (= 9 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} is VALID [2020-07-17 22:50:17,895 INFO L280 TraceCheckUtils]: 24: Hoare triple {2895#(or (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)) (= (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) 5) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (<= 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)))))))) (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) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)) (= (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))) 4)))) (= (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 (- 8))) 4) (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9))) (= 8 (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))) (= 9 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} ~i~0 := 0; {2905#(or (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)) (= (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) 5) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (<= 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))))))) (= 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_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) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)) (= (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))))) (= (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))) 4)) (<= 2 v_prenex_14)))) (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 (- 8))) 4) (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9))) (= 8 (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) (= 9 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} is VALID [2020-07-17 22:50:17,916 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_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (= (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) 5) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (<= 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))))))) (= 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_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) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)) (= (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))))) (= (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))) 4)) (<= 2 v_prenex_14)))) (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 (- 8))) 4) (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9))) (= 8 (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) (= 9 (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-17 22:50:17,919 INFO L263 TraceCheckUtils]: 26: Hoare triple {2909#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {2913#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:50:17,920 INFO L280 TraceCheckUtils]: 27: Hoare triple {2913#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2917#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:17,920 INFO L280 TraceCheckUtils]: 28: Hoare triple {2917#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2822#false} is VALID [2020-07-17 22:50:17,920 INFO L280 TraceCheckUtils]: 29: Hoare triple {2822#false} assume !false; {2822#false} is VALID [2020-07-17 22:50:17,930 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-17 22:50:17,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601366435] [2020-07-17 22:50:17,931 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:50:17,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257728198] [2020-07-17 22:50:17,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:17,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-17 22:50:17,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904876812] [2020-07-17 22:50:17,932 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-17 22:50:17,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:17,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:50:24,529 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-17 22:50:24,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:50:24,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:50:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=127, Unknown=1, NotChecked=0, Total=156 [2020-07-17 22:50:24,531 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 13 states. [2020-07-17 22:50:31,816 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2020-07-17 22:50:37,607 WARN L193 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-07-17 22:50:38,968 WARN L193 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-07-17 22:50:47,389 WARN L193 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2020-07-17 22:51:04,120 WARN L193 SmtUtils]: Spent 6.75 s on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2020-07-17 22:51:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:19,992 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2020-07-17 22:51:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 22:51:19,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-17 22:51:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:51:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 66 transitions. [2020-07-17 22:51:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:51:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 66 transitions. [2020-07-17 22:51:19,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 66 transitions. [2020-07-17 22:51:32,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 61 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:32,416 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:51:32,416 INFO L226 Difference]: Without dead ends: 67 [2020-07-17 22:51:32,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=59, Invalid=282, Unknown=1, NotChecked=0, Total=342 [2020-07-17 22:51:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-17 22:51:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2020-07-17 22:51:32,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:32,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 54 states. [2020-07-17 22:51:32,556 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 54 states. [2020-07-17 22:51:32,557 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 54 states. [2020-07-17 22:51:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:32,560 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2020-07-17 22:51:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2020-07-17 22:51:32,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:32,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:32,561 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 67 states. [2020-07-17 22:51:32,562 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 67 states. [2020-07-17 22:51:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:32,565 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2020-07-17 22:51:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2020-07-17 22:51:32,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:32,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:32,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:32,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-17 22:51:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-17 22:51:32,573 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 30 [2020-07-17 22:51:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:32,574 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-17 22:51:32,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:51:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-17 22:51:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:51:32,574 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:32,575 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-17 22:51:32,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-17 22:51:32,791 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:32,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1718620161, now seen corresponding path program 5 times [2020-07-17 22:51:32,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:32,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728611938] [2020-07-17 22:51:32,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:33,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {3263#(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; {3247#true} is VALID [2020-07-17 22:51:33,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {3247#true} assume true; {3247#true} is VALID [2020-07-17 22:51:33,023 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3247#true} {3247#true} #81#return; {3247#true} is VALID [2020-07-17 22:51:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:33,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {3247#true} ~cond := #in~cond; {3247#true} is VALID [2020-07-17 22:51:33,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {3247#true} assume !(0 == ~cond); {3247#true} is VALID [2020-07-17 22:51:33,030 INFO L280 TraceCheckUtils]: 2: Hoare triple {3247#true} assume true; {3247#true} is VALID [2020-07-17 22:51:33,030 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3247#true} {3247#true} #77#return; {3247#true} is VALID [2020-07-17 22:51:33,031 INFO L263 TraceCheckUtils]: 0: Hoare triple {3247#true} call ULTIMATE.init(); {3263#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:51:33,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {3263#(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; {3247#true} is VALID [2020-07-17 22:51:33,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {3247#true} assume true; {3247#true} is VALID [2020-07-17 22:51:33,032 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3247#true} {3247#true} #81#return; {3247#true} is VALID [2020-07-17 22:51:33,032 INFO L263 TraceCheckUtils]: 4: Hoare triple {3247#true} call #t~ret10 := main(); {3247#true} is VALID [2020-07-17 22:51:33,032 INFO L280 TraceCheckUtils]: 5: Hoare triple {3247#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {3247#true} is VALID [2020-07-17 22:51:33,032 INFO L280 TraceCheckUtils]: 6: Hoare triple {3247#true} assume !(~N~0 <= 0); {3247#true} is VALID [2020-07-17 22:51:33,033 INFO L263 TraceCheckUtils]: 7: Hoare triple {3247#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {3247#true} is VALID [2020-07-17 22:51:33,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {3247#true} ~cond := #in~cond; {3247#true} is VALID [2020-07-17 22:51:33,033 INFO L280 TraceCheckUtils]: 9: Hoare triple {3247#true} assume !(0 == ~cond); {3247#true} is VALID [2020-07-17 22:51:33,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {3247#true} assume true; {3247#true} is VALID [2020-07-17 22:51:33,034 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3247#true} {3247#true} #77#return; {3247#true} is VALID [2020-07-17 22:51:33,036 INFO L280 TraceCheckUtils]: 12: Hoare triple {3247#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(8, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {3256#(= 1 main_~i~0)} is VALID [2020-07-17 22:51:33,037 INFO L280 TraceCheckUtils]: 13: Hoare triple {3256#(= 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3256#(= 1 main_~i~0)} is VALID [2020-07-17 22:51:33,038 INFO L280 TraceCheckUtils]: 14: Hoare triple {3256#(= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3257#(<= main_~i~0 2)} is VALID [2020-07-17 22:51:33,039 INFO L280 TraceCheckUtils]: 15: Hoare triple {3257#(<= main_~i~0 2)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3257#(<= main_~i~0 2)} is VALID [2020-07-17 22:51:33,049 INFO L280 TraceCheckUtils]: 16: Hoare triple {3257#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3258#(<= main_~i~0 3)} is VALID [2020-07-17 22:51:33,051 INFO L280 TraceCheckUtils]: 17: Hoare triple {3258#(<= main_~i~0 3)} assume !(~i~0 < ~N~0); {3259#(<= ~N~0 3)} is VALID [2020-07-17 22:51:33,052 INFO L280 TraceCheckUtils]: 18: Hoare triple {3259#(<= ~N~0 3)} ~i~0 := 1; {3260#(and (<= ~N~0 3) (= 1 main_~i~0))} is VALID [2020-07-17 22:51:33,053 INFO L280 TraceCheckUtils]: 19: Hoare triple {3260#(and (<= ~N~0 3) (= 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~mem6;havoc #t~mem7; {3260#(and (<= ~N~0 3) (= 1 main_~i~0))} is VALID [2020-07-17 22:51:33,053 INFO L280 TraceCheckUtils]: 20: Hoare triple {3260#(and (<= ~N~0 3) (= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3261#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-17 22:51:33,054 INFO L280 TraceCheckUtils]: 21: Hoare triple {3261#(<= ~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~mem6;havoc #t~mem7; {3261#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-17 22:51:33,063 INFO L280 TraceCheckUtils]: 22: Hoare triple {3261#(<= ~N~0 (+ main_~i~0 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3262#(<= ~N~0 main_~i~0)} is VALID [2020-07-17 22:51:33,064 INFO L280 TraceCheckUtils]: 23: Hoare triple {3262#(<= ~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~mem6;havoc #t~mem7; {3248#false} is VALID [2020-07-17 22:51:33,064 INFO L280 TraceCheckUtils]: 24: Hoare triple {3248#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3248#false} is VALID [2020-07-17 22:51:33,065 INFO L280 TraceCheckUtils]: 25: Hoare triple {3248#false} assume !(~i~0 < ~N~0); {3248#false} is VALID [2020-07-17 22:51:33,065 INFO L280 TraceCheckUtils]: 26: Hoare triple {3248#false} ~i~0 := 0; {3248#false} is VALID [2020-07-17 22:51:33,065 INFO L280 TraceCheckUtils]: 27: Hoare triple {3248#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {3248#false} is VALID [2020-07-17 22:51:33,065 INFO L263 TraceCheckUtils]: 28: Hoare triple {3248#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {3248#false} is VALID [2020-07-17 22:51:33,066 INFO L280 TraceCheckUtils]: 29: Hoare triple {3248#false} ~cond := #in~cond; {3248#false} is VALID [2020-07-17 22:51:33,066 INFO L280 TraceCheckUtils]: 30: Hoare triple {3248#false} assume 0 == ~cond; {3248#false} is VALID [2020-07-17 22:51:33,066 INFO L280 TraceCheckUtils]: 31: Hoare triple {3248#false} assume !false; {3248#false} is VALID [2020-07-17 22:51:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:33,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728611938] [2020-07-17 22:51:33,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44172685] [2020-07-17 22:51:33,068 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-17 22:51:33,134 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-07-17 22:51:33,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:51:33,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:51:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:33,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:33,346 INFO L263 TraceCheckUtils]: 0: Hoare triple {3247#true} call ULTIMATE.init(); {3247#true} is VALID [2020-07-17 22:51:33,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {3247#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {3247#true} is VALID [2020-07-17 22:51:33,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {3247#true} assume true; {3247#true} is VALID [2020-07-17 22:51:33,347 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3247#true} {3247#true} #81#return; {3247#true} is VALID [2020-07-17 22:51:33,347 INFO L263 TraceCheckUtils]: 4: Hoare triple {3247#true} call #t~ret10 := main(); {3247#true} is VALID [2020-07-17 22:51:33,347 INFO L280 TraceCheckUtils]: 5: Hoare triple {3247#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {3247#true} is VALID [2020-07-17 22:51:33,348 INFO L280 TraceCheckUtils]: 6: Hoare triple {3247#true} assume !(~N~0 <= 0); {3247#true} is VALID [2020-07-17 22:51:33,348 INFO L263 TraceCheckUtils]: 7: Hoare triple {3247#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {3247#true} is VALID [2020-07-17 22:51:33,348 INFO L280 TraceCheckUtils]: 8: Hoare triple {3247#true} ~cond := #in~cond; {3247#true} is VALID [2020-07-17 22:51:33,348 INFO L280 TraceCheckUtils]: 9: Hoare triple {3247#true} assume !(0 == ~cond); {3247#true} is VALID [2020-07-17 22:51:33,348 INFO L280 TraceCheckUtils]: 10: Hoare triple {3247#true} assume true; {3247#true} is VALID [2020-07-17 22:51:33,349 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3247#true} {3247#true} #77#return; {3247#true} is VALID [2020-07-17 22:51:33,351 INFO L280 TraceCheckUtils]: 12: Hoare triple {3247#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(8, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {3303#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:33,352 INFO L280 TraceCheckUtils]: 13: Hoare triple {3303#(<= 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3303#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:33,360 INFO L280 TraceCheckUtils]: 14: Hoare triple {3303#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3257#(<= main_~i~0 2)} is VALID [2020-07-17 22:51:33,361 INFO L280 TraceCheckUtils]: 15: Hoare triple {3257#(<= main_~i~0 2)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3257#(<= main_~i~0 2)} is VALID [2020-07-17 22:51:33,371 INFO L280 TraceCheckUtils]: 16: Hoare triple {3257#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3258#(<= main_~i~0 3)} is VALID [2020-07-17 22:51:33,372 INFO L280 TraceCheckUtils]: 17: Hoare triple {3258#(<= main_~i~0 3)} assume !(~i~0 < ~N~0); {3259#(<= ~N~0 3)} is VALID [2020-07-17 22:51:33,373 INFO L280 TraceCheckUtils]: 18: Hoare triple {3259#(<= ~N~0 3)} ~i~0 := 1; {3322#(and (<= ~N~0 3) (<= 1 main_~i~0))} is VALID [2020-07-17 22:51:33,374 INFO L280 TraceCheckUtils]: 19: Hoare triple {3322#(and (<= ~N~0 3) (<= 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~mem6;havoc #t~mem7; {3322#(and (<= ~N~0 3) (<= 1 main_~i~0))} is VALID [2020-07-17 22:51:33,382 INFO L280 TraceCheckUtils]: 20: Hoare triple {3322#(and (<= ~N~0 3) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3329#(and (<= 2 main_~i~0) (<= ~N~0 3))} is VALID [2020-07-17 22:51:33,384 INFO L280 TraceCheckUtils]: 21: Hoare triple {3329#(and (<= 2 main_~i~0) (<= ~N~0 3))} 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~mem6;havoc #t~mem7; {3329#(and (<= 2 main_~i~0) (<= ~N~0 3))} is VALID [2020-07-17 22:51:33,394 INFO L280 TraceCheckUtils]: 22: Hoare triple {3329#(and (<= 2 main_~i~0) (<= ~N~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3336#(and (<= ~N~0 3) (<= 3 main_~i~0))} is VALID [2020-07-17 22:51:33,396 INFO L280 TraceCheckUtils]: 23: Hoare triple {3336#(and (<= ~N~0 3) (<= 3 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~mem6;havoc #t~mem7; {3248#false} is VALID [2020-07-17 22:51:33,397 INFO L280 TraceCheckUtils]: 24: Hoare triple {3248#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3248#false} is VALID [2020-07-17 22:51:33,397 INFO L280 TraceCheckUtils]: 25: Hoare triple {3248#false} assume !(~i~0 < ~N~0); {3248#false} is VALID [2020-07-17 22:51:33,397 INFO L280 TraceCheckUtils]: 26: Hoare triple {3248#false} ~i~0 := 0; {3248#false} is VALID [2020-07-17 22:51:33,397 INFO L280 TraceCheckUtils]: 27: Hoare triple {3248#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {3248#false} is VALID [2020-07-17 22:51:33,397 INFO L263 TraceCheckUtils]: 28: Hoare triple {3248#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {3248#false} is VALID [2020-07-17 22:51:33,398 INFO L280 TraceCheckUtils]: 29: Hoare triple {3248#false} ~cond := #in~cond; {3248#false} is VALID [2020-07-17 22:51:33,398 INFO L280 TraceCheckUtils]: 30: Hoare triple {3248#false} assume 0 == ~cond; {3248#false} is VALID [2020-07-17 22:51:33,398 INFO L280 TraceCheckUtils]: 31: Hoare triple {3248#false} assume !false; {3248#false} is VALID [2020-07-17 22:51:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:33,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:33,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2020-07-17 22:51:33,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767214894] [2020-07-17 22:51:33,400 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-07-17 22:51:33,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:33,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:51:33,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:33,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:51:33,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:51:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:51:33,549 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 14 states. [2020-07-17 22:51:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:37,923 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-07-17 22:51:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-17 22:51:37,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-07-17 22:51:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:51:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 105 transitions. [2020-07-17 22:51:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:51:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 105 transitions. [2020-07-17 22:51:37,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 105 transitions. [2020-07-17 22:51:38,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:38,484 INFO L225 Difference]: With dead ends: 100 [2020-07-17 22:51:38,484 INFO L226 Difference]: Without dead ends: 87 [2020-07-17 22:51:38,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2020-07-17 22:51:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-17 22:51:38,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2020-07-17 22:51:38,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:38,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 51 states. [2020-07-17 22:51:38,626 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 51 states. [2020-07-17 22:51:38,626 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 51 states. [2020-07-17 22:51:38,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:38,628 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2020-07-17 22:51:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2020-07-17 22:51:38,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:38,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:38,629 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 87 states. [2020-07-17 22:51:38,629 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 87 states. [2020-07-17 22:51:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:38,632 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2020-07-17 22:51:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2020-07-17 22:51:38,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:38,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:38,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:38,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-17 22:51:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-07-17 22:51:38,635 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 32 [2020-07-17 22:51:38,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:38,635 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-07-17 22:51:38,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:51:38,635 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-07-17 22:51:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:51:38,636 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:38,636 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-17 22:51:38,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:38,838 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:38,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:38,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1569644609, now seen corresponding path program 6 times [2020-07-17 22:51:38,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:38,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134611777] [2020-07-17 22:51:38,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:38,866 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:51:38,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046532757] [2020-07-17 22:51:38,867 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-17 22:51:38,936 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-07-17 22:51:38,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:51:38,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:51:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:38,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:39,206 INFO L263 TraceCheckUtils]: 0: Hoare triple {3772#true} call ULTIMATE.init(); {3772#true} is VALID [2020-07-17 22:51:39,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {3772#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {3772#true} is VALID [2020-07-17 22:51:39,207 INFO L280 TraceCheckUtils]: 2: Hoare triple {3772#true} assume true; {3772#true} is VALID [2020-07-17 22:51:39,207 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3772#true} {3772#true} #81#return; {3772#true} is VALID [2020-07-17 22:51:39,207 INFO L263 TraceCheckUtils]: 4: Hoare triple {3772#true} call #t~ret10 := main(); {3772#true} is VALID [2020-07-17 22:51:39,208 INFO L280 TraceCheckUtils]: 5: Hoare triple {3772#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {3772#true} is VALID [2020-07-17 22:51:39,208 INFO L280 TraceCheckUtils]: 6: Hoare triple {3772#true} assume !(~N~0 <= 0); {3772#true} is VALID [2020-07-17 22:51:39,208 INFO L263 TraceCheckUtils]: 7: Hoare triple {3772#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {3772#true} is VALID [2020-07-17 22:51:39,208 INFO L280 TraceCheckUtils]: 8: Hoare triple {3772#true} ~cond := #in~cond; {3772#true} is VALID [2020-07-17 22:51:39,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {3772#true} assume !(0 == ~cond); {3772#true} is VALID [2020-07-17 22:51:39,209 INFO L280 TraceCheckUtils]: 10: Hoare triple {3772#true} assume true; {3772#true} is VALID [2020-07-17 22:51:39,209 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3772#true} {3772#true} #77#return; {3772#true} is VALID [2020-07-17 22:51:39,211 INFO L280 TraceCheckUtils]: 12: Hoare triple {3772#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(8, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {3813#(<= 1 main_~i~0)} is VALID [2020-07-17 22:51:39,213 INFO L280 TraceCheckUtils]: 13: Hoare triple {3813#(<= 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3813#(<= 1 main_~i~0)} is VALID [2020-07-17 22:51:39,225 INFO L280 TraceCheckUtils]: 14: Hoare triple {3813#(<= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3820#(<= 2 main_~i~0)} is VALID [2020-07-17 22:51:39,227 INFO L280 TraceCheckUtils]: 15: Hoare triple {3820#(<= 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3820#(<= 2 main_~i~0)} is VALID [2020-07-17 22:51:39,238 INFO L280 TraceCheckUtils]: 16: Hoare triple {3820#(<= 2 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3827#(<= 3 main_~i~0)} is VALID [2020-07-17 22:51:39,241 INFO L280 TraceCheckUtils]: 17: Hoare triple {3827#(<= 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(4 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3831#(<= 4 ~N~0)} is VALID [2020-07-17 22:51:39,242 INFO L280 TraceCheckUtils]: 18: Hoare triple {3831#(<= 4 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3831#(<= 4 ~N~0)} is VALID [2020-07-17 22:51:39,243 INFO L280 TraceCheckUtils]: 19: Hoare triple {3831#(<= 4 ~N~0)} assume !(~i~0 < ~N~0); {3831#(<= 4 ~N~0)} is VALID [2020-07-17 22:51:39,244 INFO L280 TraceCheckUtils]: 20: Hoare triple {3831#(<= 4 ~N~0)} ~i~0 := 1; {3841#(and (<= 4 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:51:39,246 INFO L280 TraceCheckUtils]: 21: Hoare triple {3841#(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~mem6;havoc #t~mem7; {3841#(and (<= 4 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:51:39,256 INFO L280 TraceCheckUtils]: 22: Hoare triple {3841#(and (<= 4 ~N~0) (<= main_~i~0 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3848#(and (<= main_~i~0 2) (<= 4 ~N~0))} is VALID [2020-07-17 22:51:39,259 INFO L280 TraceCheckUtils]: 23: Hoare triple {3848#(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~mem6;havoc #t~mem7; {3848#(and (<= main_~i~0 2) (<= 4 ~N~0))} is VALID [2020-07-17 22:51:39,272 INFO L280 TraceCheckUtils]: 24: Hoare triple {3848#(and (<= main_~i~0 2) (<= 4 ~N~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3855#(and (<= main_~i~0 3) (<= 4 ~N~0))} is VALID [2020-07-17 22:51:39,274 INFO L280 TraceCheckUtils]: 25: Hoare triple {3855#(and (<= main_~i~0 3) (<= 4 ~N~0))} assume !(~i~0 < ~N~0); {3773#false} is VALID [2020-07-17 22:51:39,274 INFO L280 TraceCheckUtils]: 26: Hoare triple {3773#false} ~i~0 := 0; {3773#false} is VALID [2020-07-17 22:51:39,274 INFO L280 TraceCheckUtils]: 27: Hoare triple {3773#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {3773#false} is VALID [2020-07-17 22:51:39,275 INFO L263 TraceCheckUtils]: 28: Hoare triple {3773#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {3773#false} is VALID [2020-07-17 22:51:39,275 INFO L280 TraceCheckUtils]: 29: Hoare triple {3773#false} ~cond := #in~cond; {3773#false} is VALID [2020-07-17 22:51:39,275 INFO L280 TraceCheckUtils]: 30: Hoare triple {3773#false} assume 0 == ~cond; {3773#false} is VALID [2020-07-17 22:51:39,275 INFO L280 TraceCheckUtils]: 31: Hoare triple {3773#false} assume !false; {3773#false} is VALID [2020-07-17 22:51:39,277 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-17 22:51:39,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134611777] [2020-07-17 22:51:39,277 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:51:39,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046532757] [2020-07-17 22:51:39,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:51:39,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 22:51:39,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29666344] [2020-07-17 22:51:39,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-07-17 22:51:39,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:39,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:51:39,413 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-17 22:51:39,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:51:39,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:51:39,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:51:39,415 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 9 states. [2020-07-17 22:51:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:43,582 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2020-07-17 22:51:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:51:43,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-07-17 22:51:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:51:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2020-07-17 22:51:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:51:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2020-07-17 22:51:43,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 91 transitions. [2020-07-17 22:51:44,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:44,002 INFO L225 Difference]: With dead ends: 91 [2020-07-17 22:51:44,002 INFO L226 Difference]: Without dead ends: 80 [2020-07-17 22:51:44,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:51:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-17 22:51:44,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2020-07-17 22:51:44,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:44,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 53 states. [2020-07-17 22:51:44,212 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 53 states. [2020-07-17 22:51:44,212 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 53 states. [2020-07-17 22:51:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:44,215 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2020-07-17 22:51:44,215 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2020-07-17 22:51:44,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:44,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:44,216 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 80 states. [2020-07-17 22:51:44,216 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 80 states. [2020-07-17 22:51:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:44,222 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2020-07-17 22:51:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2020-07-17 22:51:44,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:44,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:44,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:44,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-17 22:51:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-07-17 22:51:44,225 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 32 [2020-07-17 22:51:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:44,225 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-07-17 22:51:44,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:51:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-07-17 22:51:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:51:44,227 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:44,227 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-17 22:51:44,441 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:44,443 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:44,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:44,443 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-17 22:51:44,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:44,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726528724] [2020-07-17 22:51:44,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:44,460 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:51:44,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40024561] [2020-07-17 22:51:44,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:51:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:51:44,542 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:51:44,542 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:51:44,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-17 22:51:44,820 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:51:44,820 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:51:44,820 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:51:44,820 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:51:44,820 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:51:44,820 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:51:44,821 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:51:44,821 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:51:44,821 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:51:44,821 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:51:44,821 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:51:44,821 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:44,821 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:44,822 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:51:44,822 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:51:44,822 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:44,822 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:44,822 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:51:44,822 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:44,822 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:51:44,822 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:51:44,823 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:51:44,823 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:51:44,823 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:51:44,823 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:51:44,823 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:44,823 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:51:44,823 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:44,823 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-17 22:51:44,824 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-17 22:51:44,825 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-17 22:51:44,825 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-17 22:51:44,825 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-17 22:51:44,825 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:51:44,825 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:51:44,825 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-17 22:51:44,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:44 BoogieIcfgContainer [2020-07-17 22:51:44,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:44,830 INFO L168 Benchmark]: Toolchain (without parser) took 166219.16 ms. Allocated memory was 138.9 MB in the beginning and 320.9 MB in the end (delta: 181.9 MB). Free memory was 99.9 MB in the beginning and 78.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 203.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:44,830 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:44,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.45 ms. Allocated memory is still 138.9 MB. Free memory was 99.5 MB in the beginning and 88.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:44,831 INFO L168 Benchmark]: Boogie Preprocessor took 175.19 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 88.6 MB in the beginning and 179.2 MB in the end (delta: -90.6 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:44,831 INFO L168 Benchmark]: RCFGBuilder took 558.15 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 154.2 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:44,832 INFO L168 Benchmark]: TraceAbstraction took 165196.53 ms. Allocated memory was 201.9 MB in the beginning and 320.9 MB in the end (delta: 119.0 MB). Free memory was 154.2 MB in the beginning and 78.4 MB in the end (delta: 75.9 MB). Peak memory consumption was 194.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:44,833 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 138.9 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 282.45 ms. Allocated memory is still 138.9 MB. Free memory was 99.5 MB in the beginning and 88.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 175.19 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 88.6 MB in the beginning and 179.2 MB in the end (delta: -90.6 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 558.15 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 154.2 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 165196.53 ms. Allocated memory was 201.9 MB in the beginning and 320.9 MB in the end (delta: 119.0 MB). Free memory was 154.2 MB in the beginning and 78.4 MB in the end (delta: 75.9 MB). Peak memory consumption was 194.9 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)=4, 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] = 8 [L30] b[0] = 1 [L32] i=1 VAL [\old(N)=0, a={-1:0}, b={1:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={1:0}, N=2] [L32] COND TRUE i