/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-8fc6572 [2020-07-10 15:26:07,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:07,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:07,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:07,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:07,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:07,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:07,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:07,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:07,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:07,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:07,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:07,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:07,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:07,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:07,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:07,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:07,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:07,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:07,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:07,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:07,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:07,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:07,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:07,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:07,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:07,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:07,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:07,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:07,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:07,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:07,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:07,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:07,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:07,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:07,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:07,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:07,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:07,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:07,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:07,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:07,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:07,646 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:07,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:07,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:07,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:07,650 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:07,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:07,650 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:07,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:07,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:07,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:07,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:07,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:07,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:07,653 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:07,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:07,654 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:07,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:07,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:07,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:07,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:07,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:07,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:07,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:07,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:07,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:07,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:07,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:07,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:07,657 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:07,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:08,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:08,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:08,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:08,059 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:08,059 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:08,061 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-10 15:26:08,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4ed674e/309c3f98242147a1ae2a48c644732c39/FLAG3b520ad53 [2020-07-10 15:26:08,792 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:08,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-10 15:26:08,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4ed674e/309c3f98242147a1ae2a48c644732c39/FLAG3b520ad53 [2020-07-10 15:26:09,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4ed674e/309c3f98242147a1ae2a48c644732c39 [2020-07-10 15:26:09,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:09,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:09,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:09,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:09,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:09,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:09" (1/1) ... [2020-07-10 15:26:09,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab124d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09, skipping insertion in model container [2020-07-10 15:26:09,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:09" (1/1) ... [2020-07-10 15:26:09,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:09,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:09,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:09,544 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:09,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:09,644 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:09,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09 WrapperNode [2020-07-10 15:26:09,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:09,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:09,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:09,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:09,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09" (1/1) ... [2020-07-10 15:26:09,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09" (1/1) ... [2020-07-10 15:26:09,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09" (1/1) ... [2020-07-10 15:26:09,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09" (1/1) ... [2020-07-10 15:26:09,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09" (1/1) ... [2020-07-10 15:26:09,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09" (1/1) ... [2020-07-10 15:26:09,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09" (1/1) ... [2020-07-10 15:26:09,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:09,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:09,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:09,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:09,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:09,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:09,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:09,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:09,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:09,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:10,532 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:10,533 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:26:10,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:10 BoogieIcfgContainer [2020-07-10 15:26:10,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:10,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:10,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:10,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:10,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:09" (1/3) ... [2020-07-10 15:26:10,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9c7192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:10, skipping insertion in model container [2020-07-10 15:26:10,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:09" (2/3) ... [2020-07-10 15:26:10,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9c7192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:10, skipping insertion in model container [2020-07-10 15:26:10,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:10" (3/3) ... [2020-07-10 15:26:10,551 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2f.c [2020-07-10 15:26:10,566 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:10,577 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:10,597 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:10,627 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:10,628 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:10,628 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:10,628 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:10,628 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:10,628 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:10,629 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:10,629 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-10 15:26:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:26:10,658 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:10,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:10,661 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:10,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-10 15:26:10,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:10,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465219848] [2020-07-10 15:26:10,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:10,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {37#true} is VALID [2020-07-10 15:26:10,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-10 15:26:10,969 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-10 15:26:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:10,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-10 15:26:10,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-10 15:26:10,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-10 15:26:10,987 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-10 15:26:10,990 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:10,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {37#true} is VALID [2020-07-10 15:26:10,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-10 15:26:10,991 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-10 15:26:10,992 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID [2020-07-10 15:26:10,992 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {37#true} is VALID [2020-07-10 15:26:10,993 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(~N~0 <= 0); {37#true} is VALID [2020-07-10 15:26:10,993 INFO L263 TraceCheckUtils]: 7: Hoare triple {37#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {37#true} is VALID [2020-07-10 15:26:10,994 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-10 15:26:10,995 INFO L280 TraceCheckUtils]: 9: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-10 15:26:10,995 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-10 15:26:10,996 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-10 15:26:10,996 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-10 15:26:10,997 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-10 15:26:10,997 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} ~i~0 := 1; {38#false} is VALID [2020-07-10 15:26:10,998 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-10 15:26:10,998 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-10 15:26:10,998 INFO L280 TraceCheckUtils]: 17: Hoare triple {38#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {38#false} is VALID [2020-07-10 15:26:10,999 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-10 15:26:10,999 INFO L280 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2020-07-10 15:26:11,000 INFO L280 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2020-07-10 15:26:11,000 INFO L280 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-10 15:26:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:11,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465219848] [2020-07-10 15:26:11,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:11,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:11,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923985164] [2020-07-10 15:26:11,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:26:11,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:11,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:11,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:11,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:11,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:11,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:11,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:11,085 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-10 15:26:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,397 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-10 15:26:11,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:11,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:26:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-10 15:26:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-10 15:26:11,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2020-07-10 15:26:11,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:11,591 INFO L225 Difference]: With dead ends: 58 [2020-07-10 15:26:11,591 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:26:11,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:26:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 15:26:11,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:11,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:11,685 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:11,685 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,690 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-10 15:26:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 15:26:11,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:11,692 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:11,692 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,697 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-10 15:26:11,697 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 15:26:11,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:11,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:11,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:26:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-10 15:26:11,704 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-10 15:26:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:11,705 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-10 15:26:11,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-10 15:26:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:26:11,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:11,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:11,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:11,708 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:11,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-10 15:26:11,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:11,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715852625] [2020-07-10 15:26:11,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:11,762 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:11,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600468571] [2020-07-10 15:26:11,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:11,815 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:26:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:11,837 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:11,981 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:11,982 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-10 15:26:11,984 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:12,018 INFO L624 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2020-07-10 15:26:12,022 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:12,023 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2020-07-10 15:26:12,032 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:12,033 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-10 15:26:12,034 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) [2020-07-10 15:26:12,109 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:12,111 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-10 15:26:12,113 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-10 15:26:12,127 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-10 15:26:12,128 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:12,129 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-10 15:26:12,132 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:12,133 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~b~0.base, main_~b~0.offset]. (let ((.cse0 (select |#memory_int| main_~b~0.base))) (and (= (select .cse0 main_~b~0.offset) 1) (= (select .cse0 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|) (= 0 main_~i~0))) [2020-07-10 15:26:12,133 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-10 15:26:12,207 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {221#true} is VALID [2020-07-10 15:26:12,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {221#true} is VALID [2020-07-10 15:26:12,208 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:12,209 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-10 15:26:12,209 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret10 := main(); {221#true} is VALID [2020-07-10 15:26:12,210 INFO L280 TraceCheckUtils]: 5: Hoare triple {221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {221#true} is VALID [2020-07-10 15:26:12,210 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {221#true} is VALID [2020-07-10 15:26:12,211 INFO L263 TraceCheckUtils]: 7: Hoare triple {221#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {221#true} is VALID [2020-07-10 15:26:12,211 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-10 15:26:12,211 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-10 15:26:12,212 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:12,212 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {221#true} #77#return; {221#true} is VALID [2020-07-10 15:26:12,215 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-10 15:26:12,216 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} assume !(~i~0 < ~N~0); {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-10 15:26:12,217 INFO L280 TraceCheckUtils]: 14: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} ~i~0 := 1; {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-10 15:26:12,219 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} assume !(~i~0 < ~N~0); {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-10 15:26:12,221 INFO L280 TraceCheckUtils]: 16: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} ~i~0 := 0; {275#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:26:12,222 INFO L280 TraceCheckUtils]: 17: Hoare triple {275#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {279#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} is VALID [2020-07-10 15:26:12,224 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-10 15:26:12,225 INFO L280 TraceCheckUtils]: 19: Hoare triple {283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:26:12,226 INFO L280 TraceCheckUtils]: 20: Hoare triple {287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {222#false} is VALID [2020-07-10 15:26:12,227 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-10 15:26:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:12,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715852625] [2020-07-10 15:26:12,230 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:12,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600468571] [2020-07-10 15:26:12,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:12,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:26:12,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434831755] [2020-07-10 15:26:12,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:26:12,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:12,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:26:12,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:12,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:26:12,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:12,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:26:12,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:26:12,274 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-10 15:26:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:12,874 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-10 15:26:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:26:12,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:26:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-10 15:26:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-10 15:26:12,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2020-07-10 15:26:13,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:13,007 INFO L225 Difference]: With dead ends: 47 [2020-07-10 15:26:13,007 INFO L226 Difference]: Without dead ends: 45 [2020-07-10 15:26:13,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:26:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-10 15:26:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-10 15:26:13,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:13,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 39 states. [2020-07-10 15:26:13,051 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 39 states. [2020-07-10 15:26:13,051 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 39 states. [2020-07-10 15:26:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:13,058 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-10 15:26:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-10 15:26:13,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:13,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:13,060 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 45 states. [2020-07-10 15:26:13,061 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 45 states. [2020-07-10 15:26:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:13,066 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-10 15:26:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-10 15:26:13,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:13,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:13,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:13,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:26:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-10 15:26:13,073 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-10 15:26:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:13,074 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-10 15:26:13,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:26:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-10 15:26:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:26:13,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:13,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:13,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:26:13,290 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-10 15:26:13,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:13,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884611709] [2020-07-10 15:26:13,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:13,349 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:13,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [792362698] [2020-07-10 15:26:13,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:13,417 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:26:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:13,430 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:13,503 INFO L263 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2020-07-10 15:26:13,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {507#true} is VALID [2020-07-10 15:26:13,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2020-07-10 15:26:13,504 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #81#return; {507#true} is VALID [2020-07-10 15:26:13,505 INFO L263 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret10 := main(); {507#true} is VALID [2020-07-10 15:26:13,505 INFO L280 TraceCheckUtils]: 5: Hoare triple {507#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {507#true} is VALID [2020-07-10 15:26:13,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {507#true} assume !(~N~0 <= 0); {507#true} is VALID [2020-07-10 15:26:13,506 INFO L263 TraceCheckUtils]: 7: Hoare triple {507#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {507#true} is VALID [2020-07-10 15:26:13,506 INFO L280 TraceCheckUtils]: 8: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2020-07-10 15:26:13,506 INFO L280 TraceCheckUtils]: 9: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2020-07-10 15:26:13,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {507#true} assume true; {507#true} is VALID [2020-07-10 15:26:13,507 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {507#true} {507#true} #77#return; {507#true} is VALID [2020-07-10 15:26:13,509 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-10 15:26:13,510 INFO L280 TraceCheckUtils]: 13: Hoare triple {548#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {552#(<= ~N~0 1)} is VALID [2020-07-10 15:26:13,514 INFO L280 TraceCheckUtils]: 14: Hoare triple {552#(<= ~N~0 1)} ~i~0 := 1; {556#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-10 15:26:13,516 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-10 15:26:13,517 INFO L280 TraceCheckUtils]: 16: Hoare triple {508#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {508#false} is VALID [2020-07-10 15:26:13,517 INFO L280 TraceCheckUtils]: 17: Hoare triple {508#false} assume !(~i~0 < ~N~0); {508#false} is VALID [2020-07-10 15:26:13,517 INFO L280 TraceCheckUtils]: 18: Hoare triple {508#false} ~i~0 := 0; {508#false} is VALID [2020-07-10 15:26:13,517 INFO L280 TraceCheckUtils]: 19: Hoare triple {508#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {508#false} is VALID [2020-07-10 15:26:13,517 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-10 15:26:13,518 INFO L280 TraceCheckUtils]: 21: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2020-07-10 15:26:13,518 INFO L280 TraceCheckUtils]: 22: Hoare triple {508#false} assume 0 == ~cond; {508#false} is VALID [2020-07-10 15:26:13,518 INFO L280 TraceCheckUtils]: 23: Hoare triple {508#false} assume !false; {508#false} is VALID [2020-07-10 15:26:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:13,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884611709] [2020-07-10 15:26:13,520 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:13,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792362698] [2020-07-10 15:26:13,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:13,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:13,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389911943] [2020-07-10 15:26:13,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:26:13,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:13,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:13,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:13,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:13,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:13,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:13,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:13,565 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-10 15:26:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:13,962 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-10 15:26:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:13,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:26:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-10 15:26:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-10 15:26:13,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2020-07-10 15:26:14,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:14,094 INFO L225 Difference]: With dead ends: 71 [2020-07-10 15:26:14,095 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 15:26:14,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:26:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 15:26:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-10 15:26:14,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:14,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 39 states. [2020-07-10 15:26:14,133 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 39 states. [2020-07-10 15:26:14,133 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 39 states. [2020-07-10 15:26:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:14,138 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-10 15:26:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-10 15:26:14,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:14,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:14,140 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 58 states. [2020-07-10 15:26:14,140 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 58 states. [2020-07-10 15:26:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:14,145 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-10 15:26:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-10 15:26:14,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:14,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:14,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:14,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:26:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-10 15:26:14,150 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-10 15:26:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:14,151 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-10 15:26:14,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-10 15:26:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:26:14,152 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:14,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:14,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:14,367 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-10 15:26:14,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:14,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875551059] [2020-07-10 15:26:14,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:14,394 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:14,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011754569] [2020-07-10 15:26:14,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:14,440 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:26:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:14,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:14,537 INFO L263 TraceCheckUtils]: 0: Hoare triple {856#true} call ULTIMATE.init(); {856#true} is VALID [2020-07-10 15:26:14,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {856#true} is VALID [2020-07-10 15:26:14,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {856#true} assume true; {856#true} is VALID [2020-07-10 15:26:14,539 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {856#true} {856#true} #81#return; {856#true} is VALID [2020-07-10 15:26:14,539 INFO L263 TraceCheckUtils]: 4: Hoare triple {856#true} call #t~ret10 := main(); {856#true} is VALID [2020-07-10 15:26:14,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {856#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {856#true} is VALID [2020-07-10 15:26:14,540 INFO L280 TraceCheckUtils]: 6: Hoare triple {856#true} assume !(~N~0 <= 0); {856#true} is VALID [2020-07-10 15:26:14,540 INFO L263 TraceCheckUtils]: 7: Hoare triple {856#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {856#true} is VALID [2020-07-10 15:26:14,540 INFO L280 TraceCheckUtils]: 8: Hoare triple {856#true} ~cond := #in~cond; {856#true} is VALID [2020-07-10 15:26:14,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {856#true} assume !(0 == ~cond); {856#true} is VALID [2020-07-10 15:26:14,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {856#true} assume true; {856#true} is VALID [2020-07-10 15:26:14,541 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {856#true} {856#true} #77#return; {856#true} is VALID [2020-07-10 15:26:14,550 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-10 15:26:14,552 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-10 15:26:14,553 INFO L280 TraceCheckUtils]: 14: Hoare triple {901#(<= 2 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {901#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:14,553 INFO L280 TraceCheckUtils]: 15: Hoare triple {901#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {901#(<= 2 ~N~0)} is VALID [2020-07-10 15:26:14,554 INFO L280 TraceCheckUtils]: 16: Hoare triple {901#(<= 2 ~N~0)} ~i~0 := 1; {911#(and (<= 2 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:26:14,555 INFO L280 TraceCheckUtils]: 17: Hoare triple {911#(and (<= 2 ~N~0) (<= main_~i~0 1))} assume !(~i~0 < ~N~0); {857#false} is VALID [2020-07-10 15:26:14,555 INFO L280 TraceCheckUtils]: 18: Hoare triple {857#false} ~i~0 := 0; {857#false} is VALID [2020-07-10 15:26:14,556 INFO L280 TraceCheckUtils]: 19: Hoare triple {857#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {857#false} is VALID [2020-07-10 15:26:14,556 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-10 15:26:14,558 INFO L280 TraceCheckUtils]: 21: Hoare triple {857#false} ~cond := #in~cond; {857#false} is VALID [2020-07-10 15:26:14,559 INFO L280 TraceCheckUtils]: 22: Hoare triple {857#false} assume 0 == ~cond; {857#false} is VALID [2020-07-10 15:26:14,559 INFO L280 TraceCheckUtils]: 23: Hoare triple {857#false} assume !false; {857#false} is VALID [2020-07-10 15:26:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:14,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875551059] [2020-07-10 15:26:14,561 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:14,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011754569] [2020-07-10 15:26:14,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:14,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-10 15:26:14,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586375794] [2020-07-10 15:26:14,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:26:14,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:14,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:14,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:14,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:14,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:14,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:14,608 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2020-07-10 15:26:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:14,937 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-10 15:26:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:26:14,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:26:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-10 15:26:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-10 15:26:14,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2020-07-10 15:26:15,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:15,049 INFO L225 Difference]: With dead ends: 66 [2020-07-10 15:26:15,049 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 15:26:15,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:26:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 15:26:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-10 15:26:15,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:15,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 40 states. [2020-07-10 15:26:15,101 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 40 states. [2020-07-10 15:26:15,101 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 40 states. [2020-07-10 15:26:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:15,106 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-10 15:26:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 15:26:15,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:15,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:15,108 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 55 states. [2020-07-10 15:26:15,108 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 55 states. [2020-07-10 15:26:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:15,111 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-10 15:26:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 15:26:15,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:15,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:15,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:15,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:26:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-10 15:26:15,116 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-10 15:26:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:15,117 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-10 15:26:15,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-10 15:26:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:26:15,118 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:15,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:15,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:15,335 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:15,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:15,336 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-10 15:26:15,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:15,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279434644] [2020-07-10 15:26:15,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:15,366 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:15,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323814558] [2020-07-10 15:26:15,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:15,441 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-10 15:26:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:15,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:15,507 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-10 15:26:15,510 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:15,525 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:15,541 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-10 15:26:15,542 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:15,553 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:15,554 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:15,554 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-10 15:26:15,560 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:15,561 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-10 15:26:15,561 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-10 15:26:15,662 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-10 15:26:15,663 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-10 15:26:15,668 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:15,707 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-10 15:26:15,712 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:15,725 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:26:15,726 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-10 15:26:15,741 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:15,742 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-10 15:26:15,742 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-10 15:26:15,745 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:15,804 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:15,867 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:15,933 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:16,074 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-10 15:26:16,075 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:16,143 INFO L440 ElimStorePlain]: Different costs {12=[v_prenex_3], 20=[|v_#memory_int_14|]} [2020-07-10 15:26:16,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:16,172 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-10 15:26:16,173 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2020-07-10 15:26:16,182 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:16,246 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:16,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:16,338 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-10 15:26:16,339 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 85 [2020-07-10 15:26:16,358 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:16,449 INFO L624 ElimStorePlain]: treesize reduction 69, result has 62.5 percent of original size [2020-07-10 15:26:16,465 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-07-10 15:26:16,466 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:115 [2020-07-10 15:26:16,482 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:16,482 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-10 15:26:16,483 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-10 15:26:17,675 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-10 15:26:23,972 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-10 15:26:23,991 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:24,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:24,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:24,086 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:26:24,091 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:26:24,117 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-10 15:26:24,117 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-10 15:26:24,133 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:26:24,134 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:24,140 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:24,187 INFO L350 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2020-07-10 15:26:24,188 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-10 15:26:24,193 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-07-10 15:26:24,230 INFO L624 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2020-07-10 15:26:24,234 INFO L544 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:24,235 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:7 [2020-07-10 15:26:24,248 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:24,249 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-10 15:26:24,250 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-10 15:26:24,383 INFO L263 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2020-07-10 15:26:24,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1194#true} is VALID [2020-07-10 15:26:24,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2020-07-10 15:26:24,384 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #81#return; {1194#true} is VALID [2020-07-10 15:26:24,385 INFO L263 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret10 := main(); {1194#true} is VALID [2020-07-10 15:26:24,385 INFO L280 TraceCheckUtils]: 5: Hoare triple {1194#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1194#true} is VALID [2020-07-10 15:26:24,385 INFO L280 TraceCheckUtils]: 6: Hoare triple {1194#true} assume !(~N~0 <= 0); {1194#true} is VALID [2020-07-10 15:26:24,385 INFO L263 TraceCheckUtils]: 7: Hoare triple {1194#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1194#true} is VALID [2020-07-10 15:26:24,386 INFO L280 TraceCheckUtils]: 8: Hoare triple {1194#true} ~cond := #in~cond; {1194#true} is VALID [2020-07-10 15:26:24,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {1194#true} assume !(0 == ~cond); {1194#true} is VALID [2020-07-10 15:26:24,386 INFO L280 TraceCheckUtils]: 10: Hoare triple {1194#true} assume true; {1194#true} is VALID [2020-07-10 15:26:24,386 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1194#true} {1194#true} #77#return; {1194#true} is VALID [2020-07-10 15:26:24,395 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-10 15:26:24,407 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-10 15:26:24,411 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-10 15:26:24,415 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-10 15:26:24,422 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-10 15:26:25,819 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-10 15:26:25,821 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-10 15:26:25,822 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-10 15:26:25,823 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-10 15:26:25,831 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-10 15:26:25,838 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-10 15:26:25,839 INFO L280 TraceCheckUtils]: 23: Hoare triple {1271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:26:25,840 INFO L280 TraceCheckUtils]: 24: Hoare triple {1275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1195#false} is VALID [2020-07-10 15:26:25,840 INFO L280 TraceCheckUtils]: 25: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2020-07-10 15:26:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:25,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279434644] [2020-07-10 15:26:25,848 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:25,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323814558] [2020-07-10 15:26:25,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:25,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-10 15:26:25,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255149082] [2020-07-10 15:26:25,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 15:26:25,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:25,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:26:29,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:29,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:26:29,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:29,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:26:29,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=71, Unknown=1, NotChecked=0, Total=90 [2020-07-10 15:26:29,987 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2020-07-10 15:26:37,478 WARN L193 SmtUtils]: Spent 4.53 s on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2020-07-10 15:26:42,185 WARN L193 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2020-07-10 15:26:47,432 WARN L193 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2020-07-10 15:26:52,504 WARN L193 SmtUtils]: Spent 4.83 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2020-07-10 15:26:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:58,575 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-07-10 15:26:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:26:58,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 15:26:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:26:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2020-07-10 15:26:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:26:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2020-07-10 15:26:58,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2020-07-10 15:27:05,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 67 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:05,307 INFO L225 Difference]: With dead ends: 69 [2020-07-10 15:27:05,307 INFO L226 Difference]: Without dead ends: 67 [2020-07-10 15:27:05,308 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2020-07-10 15:27:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-10 15:27:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2020-07-10 15:27:05,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:05,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 46 states. [2020-07-10 15:27:05,385 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 46 states. [2020-07-10 15:27:05,385 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 46 states. [2020-07-10 15:27:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:05,390 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-10 15:27:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-10 15:27:05,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:05,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:05,391 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 67 states. [2020-07-10 15:27:05,391 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 67 states. [2020-07-10 15:27:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:05,395 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-10 15:27:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-10 15:27:05,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:05,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:05,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:05,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:27:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2020-07-10 15:27:05,398 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 26 [2020-07-10 15:27:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:05,398 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-07-10 15:27:05,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:27:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2020-07-10 15:27:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:05,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:05,400 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:05,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:05,601 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:05,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1499578309, now seen corresponding path program 2 times [2020-07-10 15:27:05,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:05,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022627936] [2020-07-10 15:27:05,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:05,864 INFO L280 TraceCheckUtils]: 0: Hoare triple {1603#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1589#true} is VALID [2020-07-10 15:27:05,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:05,866 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1589#true} {1589#true} #81#return; {1589#true} is VALID [2020-07-10 15:27:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:05,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {1589#true} ~cond := #in~cond; {1589#true} is VALID [2020-07-10 15:27:05,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {1589#true} assume !(0 == ~cond); {1589#true} is VALID [2020-07-10 15:27:05,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:05,877 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #77#return; {1589#true} is VALID [2020-07-10 15:27:05,879 INFO L263 TraceCheckUtils]: 0: Hoare triple {1589#true} call ULTIMATE.init(); {1603#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:05,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {1603#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1589#true} is VALID [2020-07-10 15:27:05,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:05,880 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #81#return; {1589#true} is VALID [2020-07-10 15:27:05,880 INFO L263 TraceCheckUtils]: 4: Hoare triple {1589#true} call #t~ret10 := main(); {1589#true} is VALID [2020-07-10 15:27:05,880 INFO L280 TraceCheckUtils]: 5: Hoare triple {1589#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1589#true} is VALID [2020-07-10 15:27:05,881 INFO L280 TraceCheckUtils]: 6: Hoare triple {1589#true} assume !(~N~0 <= 0); {1589#true} is VALID [2020-07-10 15:27:05,881 INFO L263 TraceCheckUtils]: 7: Hoare triple {1589#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1589#true} is VALID [2020-07-10 15:27:05,881 INFO L280 TraceCheckUtils]: 8: Hoare triple {1589#true} ~cond := #in~cond; {1589#true} is VALID [2020-07-10 15:27:05,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {1589#true} assume !(0 == ~cond); {1589#true} is VALID [2020-07-10 15:27:05,882 INFO L280 TraceCheckUtils]: 10: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:05,882 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1589#true} {1589#true} #77#return; {1589#true} is VALID [2020-07-10 15:27:05,884 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-10 15:27:05,885 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-10 15:27:05,887 INFO L280 TraceCheckUtils]: 14: Hoare triple {1598#(= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1599#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:05,888 INFO L280 TraceCheckUtils]: 15: Hoare triple {1599#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {1600#(<= ~N~0 2)} is VALID [2020-07-10 15:27:05,890 INFO L280 TraceCheckUtils]: 16: Hoare triple {1600#(<= ~N~0 2)} ~i~0 := 1; {1601#(and (<= ~N~0 2) (= 1 main_~i~0))} is VALID [2020-07-10 15:27:05,893 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-10 15:27:05,894 INFO L280 TraceCheckUtils]: 18: Hoare triple {1601#(and (<= ~N~0 2) (= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1602#(<= ~N~0 main_~i~0)} is VALID [2020-07-10 15:27:05,896 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-10 15:27:05,896 INFO L280 TraceCheckUtils]: 20: Hoare triple {1590#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1590#false} is VALID [2020-07-10 15:27:05,896 INFO L280 TraceCheckUtils]: 21: Hoare triple {1590#false} assume !(~i~0 < ~N~0); {1590#false} is VALID [2020-07-10 15:27:05,896 INFO L280 TraceCheckUtils]: 22: Hoare triple {1590#false} ~i~0 := 0; {1590#false} is VALID [2020-07-10 15:27:05,897 INFO L280 TraceCheckUtils]: 23: Hoare triple {1590#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1590#false} is VALID [2020-07-10 15:27:05,897 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-10 15:27:05,897 INFO L280 TraceCheckUtils]: 25: Hoare triple {1590#false} ~cond := #in~cond; {1590#false} is VALID [2020-07-10 15:27:05,897 INFO L280 TraceCheckUtils]: 26: Hoare triple {1590#false} assume 0 == ~cond; {1590#false} is VALID [2020-07-10 15:27:05,898 INFO L280 TraceCheckUtils]: 27: Hoare triple {1590#false} assume !false; {1590#false} is VALID [2020-07-10 15:27:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:05,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022627936] [2020-07-10 15:27:05,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233036338] [2020-07-10 15:27:05,900 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:05,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:05,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:05,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:05,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:06,112 INFO L263 TraceCheckUtils]: 0: Hoare triple {1589#true} call ULTIMATE.init(); {1589#true} is VALID [2020-07-10 15:27:06,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {1589#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1589#true} is VALID [2020-07-10 15:27:06,114 INFO L280 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:06,114 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #81#return; {1589#true} is VALID [2020-07-10 15:27:06,114 INFO L263 TraceCheckUtils]: 4: Hoare triple {1589#true} call #t~ret10 := main(); {1589#true} is VALID [2020-07-10 15:27:06,114 INFO L280 TraceCheckUtils]: 5: Hoare triple {1589#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1589#true} is VALID [2020-07-10 15:27:06,114 INFO L280 TraceCheckUtils]: 6: Hoare triple {1589#true} assume !(~N~0 <= 0); {1589#true} is VALID [2020-07-10 15:27:06,115 INFO L263 TraceCheckUtils]: 7: Hoare triple {1589#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1589#true} is VALID [2020-07-10 15:27:06,115 INFO L280 TraceCheckUtils]: 8: Hoare triple {1589#true} ~cond := #in~cond; {1589#true} is VALID [2020-07-10 15:27:06,115 INFO L280 TraceCheckUtils]: 9: Hoare triple {1589#true} assume !(0 == ~cond); {1589#true} is VALID [2020-07-10 15:27:06,115 INFO L280 TraceCheckUtils]: 10: Hoare triple {1589#true} assume true; {1589#true} is VALID [2020-07-10 15:27:06,115 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1589#true} {1589#true} #77#return; {1589#true} is VALID [2020-07-10 15:27:06,117 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-10 15:27:06,118 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-10 15:27:06,126 INFO L280 TraceCheckUtils]: 14: Hoare triple {1643#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1599#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:06,127 INFO L280 TraceCheckUtils]: 15: Hoare triple {1599#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {1600#(<= ~N~0 2)} is VALID [2020-07-10 15:27:06,128 INFO L280 TraceCheckUtils]: 16: Hoare triple {1600#(<= ~N~0 2)} ~i~0 := 1; {1656#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-10 15:27:06,130 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-10 15:27:06,139 INFO L280 TraceCheckUtils]: 18: Hoare triple {1656#(and (<= ~N~0 2) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1663#(and (<= ~N~0 2) (<= 2 main_~i~0))} is VALID [2020-07-10 15:27:06,142 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-10 15:27:06,142 INFO L280 TraceCheckUtils]: 20: Hoare triple {1590#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1590#false} is VALID [2020-07-10 15:27:06,142 INFO L280 TraceCheckUtils]: 21: Hoare triple {1590#false} assume !(~i~0 < ~N~0); {1590#false} is VALID [2020-07-10 15:27:06,143 INFO L280 TraceCheckUtils]: 22: Hoare triple {1590#false} ~i~0 := 0; {1590#false} is VALID [2020-07-10 15:27:06,143 INFO L280 TraceCheckUtils]: 23: Hoare triple {1590#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1590#false} is VALID [2020-07-10 15:27:06,143 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-10 15:27:06,143 INFO L280 TraceCheckUtils]: 25: Hoare triple {1590#false} ~cond := #in~cond; {1590#false} is VALID [2020-07-10 15:27:06,144 INFO L280 TraceCheckUtils]: 26: Hoare triple {1590#false} assume 0 == ~cond; {1590#false} is VALID [2020-07-10 15:27:06,144 INFO L280 TraceCheckUtils]: 27: Hoare triple {1590#false} assume !false; {1590#false} is VALID [2020-07-10 15:27:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:06,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:06,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 15:27:06,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263354769] [2020-07-10 15:27:06,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:06,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:06,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:27:06,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:06,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:27:06,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:27:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:06,249 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 11 states. [2020-07-10 15:27:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:07,874 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-07-10 15:27:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 15:27:07,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2020-07-10 15:27:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2020-07-10 15:27:07,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 87 transitions. [2020-07-10 15:27:08,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:08,163 INFO L225 Difference]: With dead ends: 84 [2020-07-10 15:27:08,163 INFO L226 Difference]: Without dead ends: 71 [2020-07-10 15:27:08,164 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-10 15:27:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-10 15:27:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2020-07-10 15:27:08,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:08,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 45 states. [2020-07-10 15:27:08,245 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 45 states. [2020-07-10 15:27:08,245 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 45 states. [2020-07-10 15:27:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,250 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-10 15:27:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-10 15:27:08,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:08,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:08,251 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 71 states. [2020-07-10 15:27:08,251 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 71 states. [2020-07-10 15:27:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,255 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-10 15:27:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-10 15:27:08,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:08,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:08,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:08,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 15:27:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-10 15:27:08,259 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 28 [2020-07-10 15:27:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:08,260 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-10 15:27:08,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:27:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-10 15:27:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:08,261 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:08,261 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:08,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-10 15:27:08,475 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:08,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:08,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1048027141, now seen corresponding path program 3 times [2020-07-10 15:27:08,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:08,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754923279] [2020-07-10 15:27:08,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {2040#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2026#true} is VALID [2020-07-10 15:27:08,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:08,647 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2026#true} {2026#true} #81#return; {2026#true} is VALID [2020-07-10 15:27:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2020-07-10 15:27:08,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2020-07-10 15:27:08,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:08,656 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #77#return; {2026#true} is VALID [2020-07-10 15:27:08,657 INFO L263 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2040#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:08,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {2040#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2026#true} is VALID [2020-07-10 15:27:08,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:08,658 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #81#return; {2026#true} is VALID [2020-07-10 15:27:08,658 INFO L263 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret10 := main(); {2026#true} is VALID [2020-07-10 15:27:08,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {2026#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2026#true} is VALID [2020-07-10 15:27:08,659 INFO L280 TraceCheckUtils]: 6: Hoare triple {2026#true} assume !(~N~0 <= 0); {2026#true} is VALID [2020-07-10 15:27:08,659 INFO L263 TraceCheckUtils]: 7: Hoare triple {2026#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2026#true} is VALID [2020-07-10 15:27:08,660 INFO L280 TraceCheckUtils]: 8: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2020-07-10 15:27:08,660 INFO L280 TraceCheckUtils]: 9: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2020-07-10 15:27:08,660 INFO L280 TraceCheckUtils]: 10: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:08,660 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2026#true} {2026#true} #77#return; {2026#true} is VALID [2020-07-10 15:27:08,668 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-10 15:27:08,669 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-10 15:27:08,670 INFO L280 TraceCheckUtils]: 14: Hoare triple {2035#(= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2036#(<= 2 main_~i~0)} is VALID [2020-07-10 15:27:08,672 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-10 15:27:08,673 INFO L280 TraceCheckUtils]: 16: Hoare triple {2037#(<= 3 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2037#(<= 3 ~N~0)} is VALID [2020-07-10 15:27:08,674 INFO L280 TraceCheckUtils]: 17: Hoare triple {2037#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {2037#(<= 3 ~N~0)} is VALID [2020-07-10 15:27:08,674 INFO L280 TraceCheckUtils]: 18: Hoare triple {2037#(<= 3 ~N~0)} ~i~0 := 1; {2038#(and (<= 3 ~N~0) (= 1 main_~i~0))} is VALID [2020-07-10 15:27:08,676 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-10 15:27:08,678 INFO L280 TraceCheckUtils]: 20: Hoare triple {2038#(and (<= 3 ~N~0) (= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2039#(<= (+ main_~i~0 1) ~N~0)} is VALID [2020-07-10 15:27:08,679 INFO L280 TraceCheckUtils]: 21: Hoare triple {2039#(<= (+ main_~i~0 1) ~N~0)} assume !(~i~0 < ~N~0); {2027#false} is VALID [2020-07-10 15:27:08,680 INFO L280 TraceCheckUtils]: 22: Hoare triple {2027#false} ~i~0 := 0; {2027#false} is VALID [2020-07-10 15:27:08,680 INFO L280 TraceCheckUtils]: 23: Hoare triple {2027#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2027#false} is VALID [2020-07-10 15:27:08,681 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-10 15:27:08,681 INFO L280 TraceCheckUtils]: 25: Hoare triple {2027#false} ~cond := #in~cond; {2027#false} is VALID [2020-07-10 15:27:08,681 INFO L280 TraceCheckUtils]: 26: Hoare triple {2027#false} assume 0 == ~cond; {2027#false} is VALID [2020-07-10 15:27:08,681 INFO L280 TraceCheckUtils]: 27: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2020-07-10 15:27:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:08,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754923279] [2020-07-10 15:27:08,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181586036] [2020-07-10 15:27:08,684 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:08,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:27:08,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:08,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,758 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:08,919 INFO L263 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2020-07-10 15:27:08,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {2026#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2026#true} is VALID [2020-07-10 15:27:08,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:08,920 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #81#return; {2026#true} is VALID [2020-07-10 15:27:08,920 INFO L263 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret10 := main(); {2026#true} is VALID [2020-07-10 15:27:08,920 INFO L280 TraceCheckUtils]: 5: Hoare triple {2026#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2026#true} is VALID [2020-07-10 15:27:08,920 INFO L280 TraceCheckUtils]: 6: Hoare triple {2026#true} assume !(~N~0 <= 0); {2026#true} is VALID [2020-07-10 15:27:08,920 INFO L263 TraceCheckUtils]: 7: Hoare triple {2026#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2026#true} is VALID [2020-07-10 15:27:08,921 INFO L280 TraceCheckUtils]: 8: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2020-07-10 15:27:08,921 INFO L280 TraceCheckUtils]: 9: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2020-07-10 15:27:08,921 INFO L280 TraceCheckUtils]: 10: Hoare triple {2026#true} assume true; {2026#true} is VALID [2020-07-10 15:27:08,921 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2026#true} {2026#true} #77#return; {2026#true} is VALID [2020-07-10 15:27:08,922 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-10 15:27:08,923 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-10 15:27:08,931 INFO L280 TraceCheckUtils]: 14: Hoare triple {2080#(<= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2036#(<= 2 main_~i~0)} is VALID [2020-07-10 15:27:08,933 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-10 15:27:08,934 INFO L280 TraceCheckUtils]: 16: Hoare triple {2037#(<= 3 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2037#(<= 3 ~N~0)} is VALID [2020-07-10 15:27:08,935 INFO L280 TraceCheckUtils]: 17: Hoare triple {2037#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {2037#(<= 3 ~N~0)} is VALID [2020-07-10 15:27:08,935 INFO L280 TraceCheckUtils]: 18: Hoare triple {2037#(<= 3 ~N~0)} ~i~0 := 1; {2099#(and (<= 3 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:27:08,936 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-10 15:27:08,943 INFO L280 TraceCheckUtils]: 20: Hoare triple {2099#(and (<= 3 ~N~0) (<= main_~i~0 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2106#(and (<= 3 ~N~0) (<= main_~i~0 2))} is VALID [2020-07-10 15:27:08,944 INFO L280 TraceCheckUtils]: 21: Hoare triple {2106#(and (<= 3 ~N~0) (<= main_~i~0 2))} assume !(~i~0 < ~N~0); {2027#false} is VALID [2020-07-10 15:27:08,945 INFO L280 TraceCheckUtils]: 22: Hoare triple {2027#false} ~i~0 := 0; {2027#false} is VALID [2020-07-10 15:27:08,945 INFO L280 TraceCheckUtils]: 23: Hoare triple {2027#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2027#false} is VALID [2020-07-10 15:27:08,945 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-10 15:27:08,945 INFO L280 TraceCheckUtils]: 25: Hoare triple {2027#false} ~cond := #in~cond; {2027#false} is VALID [2020-07-10 15:27:08,945 INFO L280 TraceCheckUtils]: 26: Hoare triple {2027#false} assume 0 == ~cond; {2027#false} is VALID [2020-07-10 15:27:08,946 INFO L280 TraceCheckUtils]: 27: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2020-07-10 15:27:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:08,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:08,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 15:27:08,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116105806] [2020-07-10 15:27:08,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:08,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:08,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:27:09,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:09,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:27:09,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:09,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:27:09,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:09,048 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 11 states. [2020-07-10 15:27:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:11,582 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-07-10 15:27:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:27:11,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2020-07-10 15:27:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2020-07-10 15:27:11,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2020-07-10 15:27:11,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:11,808 INFO L225 Difference]: With dead ends: 79 [2020-07-10 15:27:11,809 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 15:27:11,809 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-10 15:27:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 15:27:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-07-10 15:27:11,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:11,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 47 states. [2020-07-10 15:27:11,885 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 47 states. [2020-07-10 15:27:11,885 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 47 states. [2020-07-10 15:27:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:11,888 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-10 15:27:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-07-10 15:27:11,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:11,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:11,889 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 68 states. [2020-07-10 15:27:11,889 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 68 states. [2020-07-10 15:27:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:11,892 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-10 15:27:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-07-10 15:27:11,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:11,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:11,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:11,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 15:27:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-10 15:27:11,895 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 28 [2020-07-10 15:27:11,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:11,895 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-10 15:27:11,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:27:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-10 15:27:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:27:11,896 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:11,897 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:12,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:12,112 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:12,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-10 15:27:12,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:12,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548416545] [2020-07-10 15:27:12,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:12,124 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:12,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563567461] [2020-07-10 15:27:12,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:12,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:27:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:12,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:12,312 INFO L263 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2020-07-10 15:27:12,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {2452#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2452#true} is VALID [2020-07-10 15:27:12,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2020-07-10 15:27:12,313 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #81#return; {2452#true} is VALID [2020-07-10 15:27:12,314 INFO L263 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret10 := main(); {2452#true} is VALID [2020-07-10 15:27:12,314 INFO L280 TraceCheckUtils]: 5: Hoare triple {2452#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2452#true} is VALID [2020-07-10 15:27:12,314 INFO L280 TraceCheckUtils]: 6: Hoare triple {2452#true} assume !(~N~0 <= 0); {2452#true} is VALID [2020-07-10 15:27:12,314 INFO L263 TraceCheckUtils]: 7: Hoare triple {2452#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2452#true} is VALID [2020-07-10 15:27:12,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2020-07-10 15:27:12,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2020-07-10 15:27:12,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {2452#true} assume true; {2452#true} is VALID [2020-07-10 15:27:12,315 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2452#true} {2452#true} #77#return; {2452#true} is VALID [2020-07-10 15:27:12,318 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-10 15:27:12,322 INFO L280 TraceCheckUtils]: 13: Hoare triple {2493#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:12,323 INFO L280 TraceCheckUtils]: 14: Hoare triple {2497#(<= ~N~0 1)} ~i~0 := 1; {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:12,323 INFO L280 TraceCheckUtils]: 15: Hoare triple {2497#(<= ~N~0 1)} assume !(~i~0 < ~N~0); {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:12,324 INFO L280 TraceCheckUtils]: 16: Hoare triple {2497#(<= ~N~0 1)} ~i~0 := 0; {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:12,325 INFO L280 TraceCheckUtils]: 17: Hoare triple {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:12,327 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-10 15:27:12,327 INFO L280 TraceCheckUtils]: 19: Hoare triple {2497#(<= ~N~0 1)} ~cond := #in~cond; {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:12,328 INFO L280 TraceCheckUtils]: 20: Hoare triple {2497#(<= ~N~0 1)} assume !(0 == ~cond); {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:12,328 INFO L280 TraceCheckUtils]: 21: Hoare triple {2497#(<= ~N~0 1)} assume true; {2497#(<= ~N~0 1)} is VALID [2020-07-10 15:27:12,329 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2497#(<= ~N~0 1)} {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} #79#return; {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:12,330 INFO L280 TraceCheckUtils]: 23: Hoare triple {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} havoc #t~mem9; {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:12,337 INFO L280 TraceCheckUtils]: 24: Hoare triple {2507#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2532#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-10 15:27:12,340 INFO L280 TraceCheckUtils]: 25: Hoare triple {2532#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2453#false} is VALID [2020-07-10 15:27:12,340 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-10 15:27:12,340 INFO L280 TraceCheckUtils]: 27: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2020-07-10 15:27:12,340 INFO L280 TraceCheckUtils]: 28: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2020-07-10 15:27:12,341 INFO L280 TraceCheckUtils]: 29: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2020-07-10 15:27:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:12,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548416545] [2020-07-10 15:27:12,343 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:12,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563567461] [2020-07-10 15:27:12,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:12,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:27:12,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211153434] [2020-07-10 15:27:12,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 15:27:12,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:12,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:27:12,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:12,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:27:12,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:12,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:27:12,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:12,443 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2020-07-10 15:27:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:13,232 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-10 15:27:13,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:27:13,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 15:27:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-10 15:27:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-10 15:27:13,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2020-07-10 15:27:13,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:13,431 INFO L225 Difference]: With dead ends: 72 [2020-07-10 15:27:13,431 INFO L226 Difference]: Without dead ends: 50 [2020-07-10 15:27:13,432 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-10 15:27:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-10 15:27:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2020-07-10 15:27:13,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:13,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 46 states. [2020-07-10 15:27:13,533 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 46 states. [2020-07-10 15:27:13,533 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 46 states. [2020-07-10 15:27:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:13,537 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-10 15:27:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-10 15:27:13,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:13,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:13,538 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 50 states. [2020-07-10 15:27:13,538 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 50 states. [2020-07-10 15:27:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:13,540 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-10 15:27:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-10 15:27:13,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:13,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:13,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:13,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:27:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-07-10 15:27:13,543 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 30 [2020-07-10 15:27:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:13,543 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-07-10 15:27:13,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:27:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-07-10 15:27:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:27:13,544 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:13,544 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:13,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:13,747 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 4 times [2020-07-10 15:27:13,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:13,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299952986] [2020-07-10 15:27:13,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:13,769 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:13,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462084722] [2020-07-10 15:27:13,769 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:13,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:27:13,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:13,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-10 15:27:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:13,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:13,932 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-10 15:27:13,933 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:13,963 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:13,975 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-10 15:27:13,976 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:14,011 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:14,012 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:27:14,013 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-10 15:27:14,026 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:14,027 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-10 15:27:14,027 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-10 15:27:14,241 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2020-07-10 15:27:14,241 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-10 15:27:14,242 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-10 15:27:14,248 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:14,428 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-07-10 15:27:14,429 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-10 15:27:14,433 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:14,437 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:27:14,438 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-10 15:27:14,516 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:14,516 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-10 15:27:14,517 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-10 15:27:14,518 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:14,664 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:14,796 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:14,803 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:14,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:14,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:14,979 INFO L244 Elim1Store]: Index analysis took 102 ms [2020-07-10 15:27:15,361 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-10 15:27:15,362 INFO L350 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2020-07-10 15:27:15,362 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 252 [2020-07-10 15:27:15,385 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-10 15:27:15,386 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:27:15,395 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-10 15:27:15,396 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-10 15:27:15,411 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-10 15:27:15,411 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:15,415 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-10 15:27:15,416 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:15,423 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:27:15,424 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:15,434 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:15,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:15,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:15,616 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-07-10 15:27:15,617 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:15,618 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 143 [2020-07-10 15:27:15,645 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-10 15:27:15,645 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:15,653 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-10 15:27:15,653 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:15,659 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:27:15,659 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:15,670 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:16,784 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 132 DAG size of output: 44 [2020-07-10 15:27:16,785 INFO L624 ElimStorePlain]: treesize reduction 775, result has 14.9 percent of original size [2020-07-10 15:27:16,800 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:16,806 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-10 15:27:16,807 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:101 [2020-07-10 15:27:16,949 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:16,950 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-10 15:27:16,950 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-10 15:27:16,953 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:17,258 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-07-10 15:27:17,273 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:17,451 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:17,682 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:18,426 WARN L193 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-07-10 15:27:18,445 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:27:18,542 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:18,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:18,557 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:18,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:18,572 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:18,652 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:18,719 INFO L244 Elim1Store]: Index analysis took 179 ms [2020-07-10 15:27:18,727 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2020-07-10 15:27:18,731 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:18,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:18,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:18,798 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:18,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:18,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:18,953 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:19,058 INFO L244 Elim1Store]: Index analysis took 276 ms [2020-07-10 15:27:19,068 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2020-07-10 15:27:19,086 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:19,122 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:19,123 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:19,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:19,172 INFO L350 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2020-07-10 15:27:19,173 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 107 [2020-07-10 15:27:19,187 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:19,789 WARN L193 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-07-10 15:27:19,790 INFO L624 ElimStorePlain]: treesize reduction 53, result has 78.5 percent of original size [2020-07-10 15:27:19,791 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-07-10 15:27:19,791 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:212, output treesize:194 [2020-07-10 15:27:20,320 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-10 15:27:20,344 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-07-10 15:27:20,344 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:27:20,935 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-07-10 15:27:20,956 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:27:21,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:21,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:21,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:21,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:21,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:21,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:21,746 INFO L244 Elim1Store]: Index analysis took 542 ms [2020-07-10 15:27:21,956 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-07-10 15:27:21,957 INFO L350 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2020-07-10 15:27:21,957 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-10 15:27:21,971 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:22,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,744 INFO L244 Elim1Store]: Index analysis took 680 ms [2020-07-10 15:27:22,794 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:22,795 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-10 15:27:22,806 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:22,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:22,967 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:22,968 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 107 [2020-07-10 15:27:22,978 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:23,661 WARN L193 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2020-07-10 15:27:23,662 INFO L624 ElimStorePlain]: treesize reduction 210, result has 53.4 percent of original size [2020-07-10 15:27:23,731 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2020-07-10 15:27:23,731 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:261, output treesize:241 [2020-07-10 15:27:23,824 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:23,824 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-10 15:27:23,824 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-10 15:27:30,557 WARN L193 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 101 [2020-07-10 15:27:38,500 WARN L193 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 104 [2020-07-10 15:27:38,543 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:27:38,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:38,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:38,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:38,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:38,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:38,893 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:38,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:38,915 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:39,281 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-10 15:27:39,282 INFO L350 Elim1Store]: treesize reduction 17, result has 84.0 percent of original size [2020-07-10 15:27:39,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 111 [2020-07-10 15:27:39,309 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-10 15:27:39,309 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:39,314 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:27:39,314 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:39,332 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:39,336 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:39,338 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:27:39,340 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:39,345 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-10 15:27:39,346 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:39,349 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:27:39,349 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:39,389 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-10 15:27:39,390 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:39,394 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:27:39,395 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:39,422 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:39,428 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:39,430 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-10 15:27:39,432 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:39,437 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-10 15:27:39,438 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:39,441 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:27:39,441 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:39,455 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-10 15:27:39,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:39,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:39,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:39,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:39,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:39,626 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:39,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:39,641 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:39,849 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-07-10 15:27:39,850 INFO L350 Elim1Store]: treesize reduction 10, result has 81.5 percent of original size [2020-07-10 15:27:39,850 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-10 15:27:39,867 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:27:39,868 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:39,875 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-10 15:27:39,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:39,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:39,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:39,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:40,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:40,002 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:40,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:40,227 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-07-10 15:27:40,228 INFO L350 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2020-07-10 15:27:40,228 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 80 [2020-07-10 15:27:40,249 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-10 15:27:40,250 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:40,253 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-10 15:27:41,309 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2020-07-10 15:27:41,312 INFO L624 ElimStorePlain]: treesize reduction 68, result has 65.7 percent of original size [2020-07-10 15:27:41,340 INFO L544 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:27:41,341 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:283, output treesize:7 [2020-07-10 15:27:41,437 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:41,438 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-10 15:27:41,438 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-10 15:27:41,809 INFO L263 TraceCheckUtils]: 0: Hoare triple {2821#true} call ULTIMATE.init(); {2821#true} is VALID [2020-07-10 15:27:41,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {2821#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2821#true} is VALID [2020-07-10 15:27:41,810 INFO L280 TraceCheckUtils]: 2: Hoare triple {2821#true} assume true; {2821#true} is VALID [2020-07-10 15:27:41,811 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2821#true} {2821#true} #81#return; {2821#true} is VALID [2020-07-10 15:27:41,811 INFO L263 TraceCheckUtils]: 4: Hoare triple {2821#true} call #t~ret10 := main(); {2821#true} is VALID [2020-07-10 15:27:41,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {2821#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2821#true} is VALID [2020-07-10 15:27:41,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {2821#true} assume !(~N~0 <= 0); {2821#true} is VALID [2020-07-10 15:27:41,812 INFO L263 TraceCheckUtils]: 7: Hoare triple {2821#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2821#true} is VALID [2020-07-10 15:27:41,812 INFO L280 TraceCheckUtils]: 8: Hoare triple {2821#true} ~cond := #in~cond; {2821#true} is VALID [2020-07-10 15:27:41,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {2821#true} assume !(0 == ~cond); {2821#true} is VALID [2020-07-10 15:27:41,813 INFO L280 TraceCheckUtils]: 10: Hoare triple {2821#true} assume true; {2821#true} is VALID [2020-07-10 15:27:41,814 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2821#true} {2821#true} #77#return; {2821#true} is VALID [2020-07-10 15:27:41,826 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-10 15:27:41,850 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-10 15:27:41,851 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-10 15:27:41,888 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-10 15:27:41,889 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-10 15:27:41,890 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-10 15:27:41,927 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-10 15:27:41,968 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-10 15:27:42,019 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-10 15:27:44,056 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-10 15:27:44,057 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-10 15:27:44,058 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-10 15:27:44,149 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-10 15:27:44,180 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-10 15:27:44,183 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-10 15:27:44,184 INFO L280 TraceCheckUtils]: 27: Hoare triple {2913#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2917#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:44,185 INFO L280 TraceCheckUtils]: 28: Hoare triple {2917#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2822#false} is VALID [2020-07-10 15:27:44,185 INFO L280 TraceCheckUtils]: 29: Hoare triple {2822#false} assume !false; {2822#false} is VALID [2020-07-10 15:27:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:44,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299952986] [2020-07-10 15:27:44,196 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:44,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462084722] [2020-07-10 15:27:44,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:27:44,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-10 15:27:44,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777700494] [2020-07-10 15:27:44,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-10 15:27:44,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:44,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:27:47,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:47,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:27:47,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:47,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:27:47,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=126, Unknown=1, NotChecked=0, Total=156 [2020-07-10 15:27:47,939 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 13 states. [2020-07-10 15:27:57,209 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2020-07-10 15:28:00,834 WARN L193 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-07-10 15:28:02,641 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-07-10 15:28:13,064 WARN L193 SmtUtils]: Spent 5.99 s on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2020-07-10 15:28:27,783 WARN L193 SmtUtils]: Spent 5.97 s on a formula simplification. DAG size of input: 133 DAG size of output: 133 [2020-07-10 15:28:43,863 WARN L193 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 135 DAG size of output: 133 [2020-07-10 15:28:54,354 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-07-10 15:28:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:56,144 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-10 15:28:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 15:28:56,145 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-10 15:28:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:28:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2020-07-10 15:28:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:28:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2020-07-10 15:28:56,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2020-07-10 15:29:08,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 66 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:08,673 INFO L225 Difference]: With dead ends: 72 [2020-07-10 15:29:08,673 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 15:29:08,674 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=71, Invalid=347, Unknown=2, NotChecked=0, Total=420 [2020-07-10 15:29:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 15:29:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2020-07-10 15:29:08,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:08,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 54 states. [2020-07-10 15:29:08,874 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 54 states. [2020-07-10 15:29:08,875 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 54 states. [2020-07-10 15:29:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:08,881 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-10 15:29:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-10 15:29:08,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:08,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:08,883 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 70 states. [2020-07-10 15:29:08,883 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 70 states. [2020-07-10 15:29:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:08,887 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-10 15:29:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-10 15:29:08,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:08,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:08,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:08,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 15:29:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-10 15:29:08,891 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 30 [2020-07-10 15:29:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:08,891 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-10 15:29:08,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:29:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-10 15:29:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 15:29:08,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:08,897 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:09,100 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-10 15:29:09,101 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:09,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1569644609, now seen corresponding path program 5 times [2020-07-10 15:29:09,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:09,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229224317] [2020-07-10 15:29:09,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:09,145 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:29:09,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67110190] [2020-07-10 15:29:09,146 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:09,223 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-07-10 15:29:09,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:09,225 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:29:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:09,238 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:09,444 INFO L263 TraceCheckUtils]: 0: Hoare triple {3260#true} call ULTIMATE.init(); {3260#true} is VALID [2020-07-10 15:29:09,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {3260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {3260#true} is VALID [2020-07-10 15:29:09,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {3260#true} assume true; {3260#true} is VALID [2020-07-10 15:29:09,445 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3260#true} {3260#true} #81#return; {3260#true} is VALID [2020-07-10 15:29:09,445 INFO L263 TraceCheckUtils]: 4: Hoare triple {3260#true} call #t~ret10 := main(); {3260#true} is VALID [2020-07-10 15:29:09,445 INFO L280 TraceCheckUtils]: 5: Hoare triple {3260#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {3260#true} is VALID [2020-07-10 15:29:09,445 INFO L280 TraceCheckUtils]: 6: Hoare triple {3260#true} assume !(~N~0 <= 0); {3260#true} is VALID [2020-07-10 15:29:09,445 INFO L263 TraceCheckUtils]: 7: Hoare triple {3260#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {3260#true} is VALID [2020-07-10 15:29:09,446 INFO L280 TraceCheckUtils]: 8: Hoare triple {3260#true} ~cond := #in~cond; {3260#true} is VALID [2020-07-10 15:29:09,446 INFO L280 TraceCheckUtils]: 9: Hoare triple {3260#true} assume !(0 == ~cond); {3260#true} is VALID [2020-07-10 15:29:09,446 INFO L280 TraceCheckUtils]: 10: Hoare triple {3260#true} assume true; {3260#true} is VALID [2020-07-10 15:29:09,447 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3260#true} {3260#true} #77#return; {3260#true} is VALID [2020-07-10 15:29:09,448 INFO L280 TraceCheckUtils]: 12: Hoare triple {3260#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; {3301#(<= 1 main_~i~0)} is VALID [2020-07-10 15:29:09,449 INFO L280 TraceCheckUtils]: 13: Hoare triple {3301#(<= 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; {3301#(<= 1 main_~i~0)} is VALID [2020-07-10 15:29:09,461 INFO L280 TraceCheckUtils]: 14: Hoare triple {3301#(<= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3308#(<= 2 main_~i~0)} is VALID [2020-07-10 15:29:09,463 INFO L280 TraceCheckUtils]: 15: Hoare triple {3308#(<= 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; {3308#(<= 2 main_~i~0)} is VALID [2020-07-10 15:29:09,475 INFO L280 TraceCheckUtils]: 16: Hoare triple {3308#(<= 2 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3315#(<= 3 main_~i~0)} is VALID [2020-07-10 15:29:09,478 INFO L280 TraceCheckUtils]: 17: Hoare triple {3315#(<= 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; {3319#(<= 4 ~N~0)} is VALID [2020-07-10 15:29:09,479 INFO L280 TraceCheckUtils]: 18: Hoare triple {3319#(<= 4 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3319#(<= 4 ~N~0)} is VALID [2020-07-10 15:29:09,479 INFO L280 TraceCheckUtils]: 19: Hoare triple {3319#(<= 4 ~N~0)} assume !(~i~0 < ~N~0); {3319#(<= 4 ~N~0)} is VALID [2020-07-10 15:29:09,480 INFO L280 TraceCheckUtils]: 20: Hoare triple {3319#(<= 4 ~N~0)} ~i~0 := 1; {3329#(and (<= 4 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:29:09,481 INFO L280 TraceCheckUtils]: 21: Hoare triple {3329#(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; {3329#(and (<= 4 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:29:09,491 INFO L280 TraceCheckUtils]: 22: Hoare triple {3329#(and (<= 4 ~N~0) (<= main_~i~0 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3336#(and (<= main_~i~0 2) (<= 4 ~N~0))} is VALID [2020-07-10 15:29:09,492 INFO L280 TraceCheckUtils]: 23: Hoare triple {3336#(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; {3336#(and (<= main_~i~0 2) (<= 4 ~N~0))} is VALID [2020-07-10 15:29:09,508 INFO L280 TraceCheckUtils]: 24: Hoare triple {3336#(and (<= main_~i~0 2) (<= 4 ~N~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3343#(and (<= main_~i~0 3) (<= 4 ~N~0))} is VALID [2020-07-10 15:29:09,509 INFO L280 TraceCheckUtils]: 25: Hoare triple {3343#(and (<= main_~i~0 3) (<= 4 ~N~0))} assume !(~i~0 < ~N~0); {3261#false} is VALID [2020-07-10 15:29:09,510 INFO L280 TraceCheckUtils]: 26: Hoare triple {3261#false} ~i~0 := 0; {3261#false} is VALID [2020-07-10 15:29:09,510 INFO L280 TraceCheckUtils]: 27: Hoare triple {3261#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {3261#false} is VALID [2020-07-10 15:29:09,510 INFO L263 TraceCheckUtils]: 28: Hoare triple {3261#false} call __VERIFIER_assert((if #t~mem9 == 1 + (2 * ~i~0 * ~i~0 + 2 * ~i~0) then 1 else 0)); {3261#false} is VALID [2020-07-10 15:29:09,510 INFO L280 TraceCheckUtils]: 29: Hoare triple {3261#false} ~cond := #in~cond; {3261#false} is VALID [2020-07-10 15:29:09,510 INFO L280 TraceCheckUtils]: 30: Hoare triple {3261#false} assume 0 == ~cond; {3261#false} is VALID [2020-07-10 15:29:09,510 INFO L280 TraceCheckUtils]: 31: Hoare triple {3261#false} assume !false; {3261#false} is VALID [2020-07-10 15:29:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:09,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229224317] [2020-07-10 15:29:09,512 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:29:09,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67110190] [2020-07-10 15:29:09,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:29:09,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-10 15:29:09,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691603971] [2020-07-10 15:29:09,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-07-10 15:29:09,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:09,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:29:09,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:09,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:29:09,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:09,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:29:09,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:29:09,652 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 9 states. [2020-07-10 15:29:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:14,741 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2020-07-10 15:29:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 15:29:14,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-07-10 15:29:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:29:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2020-07-10 15:29:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:29:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2020-07-10 15:29:14,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 92 transitions. [2020-07-10 15:29:15,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:15,242 INFO L225 Difference]: With dead ends: 100 [2020-07-10 15:29:15,242 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 15:29:15,243 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-10 15:29:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 15:29:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2020-07-10 15:29:15,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:15,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 56 states. [2020-07-10 15:29:15,408 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 56 states. [2020-07-10 15:29:15,408 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 56 states. [2020-07-10 15:29:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:15,411 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2020-07-10 15:29:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2020-07-10 15:29:15,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:15,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:15,412 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 89 states. [2020-07-10 15:29:15,412 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 89 states. [2020-07-10 15:29:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:15,415 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2020-07-10 15:29:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2020-07-10 15:29:15,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:15,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:15,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:15,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 15:29:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-07-10 15:29:15,417 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2020-07-10 15:29:15,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:15,418 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-07-10 15:29:15,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:29:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-10 15:29:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:29:15,418 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:15,419 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:15,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:15,635 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:15,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:15,636 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-10 15:29:15,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:15,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215224302] [2020-07-10 15:29:15,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:15,647 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:29:15,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649643566] [2020-07-10 15:29:15,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:29:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:29:15,746 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:29:15,746 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:29:15,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:16,027 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:29:16,027 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:29:16,027 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:29:16,027 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:16,028 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:29:16,028 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:29:16,028 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:29:16,028 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:29:16,028 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:29:16,028 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:29:16,028 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:29:16,028 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:29:16,028 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:29:16,029 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:29:16,029 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:29:16,029 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:16,029 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:16,029 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:29:16,029 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:16,029 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:29:16,029 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:29:16,029 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:29:16,030 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:29:16,030 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:29:16,030 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:29:16,030 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:16,030 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:29:16,030 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:16,030 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-10 15:29:16,030 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-10 15:29:16,030 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-10 15:29:16,030 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-10 15:29:16,031 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-10 15:29:16,031 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-10 15:29:16,031 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-10 15:29:16,031 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-10 15:29:16,031 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-10 15:29:16,031 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-10 15:29:16,031 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-10 15:29:16,031 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-10 15:29:16,031 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-10 15:29:16,032 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-10 15:29:16,032 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-10 15:29:16,032 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-10 15:29:16,032 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:29:16,032 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:29:16,032 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:16,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:16 BoogieIcfgContainer [2020-07-10 15:29:16,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:16,038 INFO L168 Benchmark]: Toolchain (without parser) took 186939.00 ms. Allocated memory was 136.3 MB in the beginning and 334.0 MB in the end (delta: 197.7 MB). Free memory was 99.8 MB in the beginning and 175.4 MB in the end (delta: -75.6 MB). Peak memory consumption was 122.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:16,038 INFO L168 Benchmark]: CDTParser took 0.77 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:16,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.07 ms. Allocated memory is still 136.3 MB. Free memory was 99.6 MB in the beginning and 88.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:16,039 INFO L168 Benchmark]: Boogie Preprocessor took 236.02 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 88.6 MB in the beginning and 178.7 MB in the end (delta: -90.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:16,039 INFO L168 Benchmark]: RCFGBuilder took 655.54 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 154.4 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:16,040 INFO L168 Benchmark]: TraceAbstraction took 185494.07 ms. Allocated memory was 201.3 MB in the beginning and 334.0 MB in the end (delta: 132.6 MB). Free memory was 153.8 MB in the beginning and 175.4 MB in the end (delta: -21.7 MB). Peak memory consumption was 111.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:16,042 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.77 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 546.07 ms. Allocated memory is still 136.3 MB. Free memory was 99.6 MB in the beginning and 88.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 236.02 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 88.6 MB in the beginning and 178.7 MB in the end (delta: -90.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 655.54 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 154.4 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 185494.07 ms. Allocated memory was 201.3 MB in the beginning and 334.0 MB in the end (delta: 132.6 MB). Free memory was 153.8 MB in the beginning and 175.4 MB in the end (delta: -21.7 MB). Peak memory consumption was 111.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=3, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] a[0] = 8 [L30] b[0] = 1 [L32] i=1 VAL [\old(N)=0, a={-1:0}, b={-2:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={-2:0}, N=2] [L32] COND TRUE i