/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/s2iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:37,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:37,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:37,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:37,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:37,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:37,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:37,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:37,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:37,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:37,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:37,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:37,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:37,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:37,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:37,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:37,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:37,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:37,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:37,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:37,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:37,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:37,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:37,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:37,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:37,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:37,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:37,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:37,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:37,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:37,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:37,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:37,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:37,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:37,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:37,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:37,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:37,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:37,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:37,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:37,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:37,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:49:37,775 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:37,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:37,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:37,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:37,777 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:37,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:37,777 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:37,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:37,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:37,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:37,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:37,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:37,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:37,779 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:37,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:37,779 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:37,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:37,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:37,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:37,780 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:37,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:37,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:37,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:37,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:37,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:37,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:37,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:37,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:37,782 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:37,782 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:38,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:38,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:38,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:38,152 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:38,152 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:38,153 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s2iff.c [2020-07-17 22:49:38,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/432b3a28d/c1030ec057c445b896adfaf1102aa217/FLAG67fe19b7d [2020-07-17 22:49:38,698 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:38,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s2iff.c [2020-07-17 22:49:38,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/432b3a28d/c1030ec057c445b896adfaf1102aa217/FLAG67fe19b7d [2020-07-17 22:49:39,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/432b3a28d/c1030ec057c445b896adfaf1102aa217 [2020-07-17 22:49:39,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:39,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:39,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:39,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:39,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:39,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:39" (1/1) ... [2020-07-17 22:49:39,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fff63fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39, skipping insertion in model container [2020-07-17 22:49:39,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:39" (1/1) ... [2020-07-17 22:49:39,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:39,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:39,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:39,309 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:39,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:39,358 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:39,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39 WrapperNode [2020-07-17 22:49:39,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:39,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:39,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:39,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:39,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39" (1/1) ... [2020-07-17 22:49:39,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39" (1/1) ... [2020-07-17 22:49:39,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39" (1/1) ... [2020-07-17 22:49:39,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39" (1/1) ... [2020-07-17 22:49:39,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39" (1/1) ... [2020-07-17 22:49:39,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39" (1/1) ... [2020-07-17 22:49:39,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39" (1/1) ... [2020-07-17 22:49:39,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:39,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:39,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:39,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:39,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:39,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:39,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:39,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:39,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:39,565 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:49:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:39,939 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:39,939 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:49:39,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:39 BoogieIcfgContainer [2020-07-17 22:49:39,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:39,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:39,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:39,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:39,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:39" (1/3) ... [2020-07-17 22:49:39,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b58d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:39, skipping insertion in model container [2020-07-17 22:49:39,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:39" (2/3) ... [2020-07-17 22:49:39,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b58d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:39, skipping insertion in model container [2020-07-17 22:49:39,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:39" (3/3) ... [2020-07-17 22:49:39,951 INFO L109 eAbstractionObserver]: Analyzing ICFG s2iff.c [2020-07-17 22:49:39,962 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:39,970 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:39,985 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:40,019 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:40,020 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:40,020 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:40,020 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:40,020 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:40,020 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:40,020 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:40,020 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-17 22:49:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:49:40,042 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:40,043 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] [2020-07-17 22:49:40,044 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:40,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash -432131487, now seen corresponding path program 1 times [2020-07-17 22:49:40,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:40,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401436243] [2020-07-17 22:49:40,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:40,279 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(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; {35#true} is VALID [2020-07-17 22:49:40,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-17 22:49:40,280 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-17 22:49:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:40,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-17 22:49:40,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-17 22:49:40,296 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-17 22:49:40,297 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-17 22:49:40,299 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:40,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(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; {35#true} is VALID [2020-07-17 22:49:40,300 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-17 22:49:40,301 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-17 22:49:40,301 INFO L263 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret10 := main(); {35#true} is VALID [2020-07-17 22:49:40,302 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {35#true} is VALID [2020-07-17 22:49:40,302 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~N~0 <= 0); {35#true} is VALID [2020-07-17 22:49:40,303 INFO L263 TraceCheckUtils]: 7: Hoare triple {35#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {35#true} is VALID [2020-07-17 22:49:40,303 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-17 22:49:40,304 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-17 22:49:40,305 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-17 22:49:40,305 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-17 22:49:40,306 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {36#false} is VALID [2020-07-17 22:49:40,306 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-17 22:49:40,307 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2020-07-17 22:49:40,307 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-17 22:49:40,308 INFO L280 TraceCheckUtils]: 16: Hoare triple {36#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {36#false} is VALID [2020-07-17 22:49:40,308 INFO L263 TraceCheckUtils]: 17: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem9 == 3 * ~N~0 then 1 else 0)); {36#false} is VALID [2020-07-17 22:49:40,308 INFO L280 TraceCheckUtils]: 18: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2020-07-17 22:49:40,309 INFO L280 TraceCheckUtils]: 19: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2020-07-17 22:49:40,309 INFO L280 TraceCheckUtils]: 20: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-17 22:49:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:40,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401436243] [2020-07-17 22:49:40,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:40,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:40,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308974564] [2020-07-17 22:49:40,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:49:40,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:40,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:40,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:40,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:40,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:40,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:40,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:40,402 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-17 22:49:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:40,598 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2020-07-17 22:49:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:40,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:49:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-17 22:49:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-17 22:49:40,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2020-07-17 22:49:40,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:40,744 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:49:40,745 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 22:49:40,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 22:49:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-17 22:49:40,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:40,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-17 22:49:40,804 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-17 22:49:40,804 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-17 22:49:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:40,809 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-17 22:49:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:49:40,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:40,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:40,811 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-17 22:49:40,811 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-17 22:49:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:40,828 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-17 22:49:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:49:40,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:40,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:40,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:40,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:49:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-17 22:49:40,834 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2020-07-17 22:49:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:40,834 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-17 22:49:40,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:49:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:49:40,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:40,836 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] [2020-07-17 22:49:40,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:40,837 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:40,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:40,837 INFO L82 PathProgramCache]: Analyzing trace with hash -173966049, now seen corresponding path program 1 times [2020-07-17 22:49:40,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:40,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231121744] [2020-07-17 22:49:40,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:40,963 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#(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; {200#true} is VALID [2020-07-17 22:49:40,964 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-17 22:49:40,964 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-17 22:49:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:40,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-17 22:49:40,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-17 22:49:40,975 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-17 22:49:40,976 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:40,977 INFO L263 TraceCheckUtils]: 0: Hoare triple {200#true} call ULTIMATE.init(); {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:40,977 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#(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; {200#true} is VALID [2020-07-17 22:49:40,978 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-17 22:49:40,978 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-17 22:49:40,978 INFO L263 TraceCheckUtils]: 4: Hoare triple {200#true} call #t~ret10 := main(); {200#true} is VALID [2020-07-17 22:49:40,979 INFO L280 TraceCheckUtils]: 5: Hoare triple {200#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {200#true} is VALID [2020-07-17 22:49:40,980 INFO L280 TraceCheckUtils]: 6: Hoare triple {200#true} assume !(~N~0 <= 0); {205#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:40,980 INFO L263 TraceCheckUtils]: 7: Hoare triple {205#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {200#true} is VALID [2020-07-17 22:49:40,981 INFO L280 TraceCheckUtils]: 8: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-17 22:49:40,981 INFO L280 TraceCheckUtils]: 9: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-17 22:49:40,981 INFO L280 TraceCheckUtils]: 10: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-17 22:49:40,982 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:40,984 INFO L280 TraceCheckUtils]: 12: Hoare triple {205#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {210#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:40,985 INFO L280 TraceCheckUtils]: 13: Hoare triple {210#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-17 22:49:40,986 INFO L280 TraceCheckUtils]: 14: Hoare triple {201#false} ~i~0 := 0; {201#false} is VALID [2020-07-17 22:49:40,986 INFO L280 TraceCheckUtils]: 15: Hoare triple {201#false} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-17 22:49:40,986 INFO L280 TraceCheckUtils]: 16: Hoare triple {201#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {201#false} is VALID [2020-07-17 22:49:40,987 INFO L263 TraceCheckUtils]: 17: Hoare triple {201#false} call __VERIFIER_assert((if #t~mem9 == 3 * ~N~0 then 1 else 0)); {201#false} is VALID [2020-07-17 22:49:40,987 INFO L280 TraceCheckUtils]: 18: Hoare triple {201#false} ~cond := #in~cond; {201#false} is VALID [2020-07-17 22:49:40,987 INFO L280 TraceCheckUtils]: 19: Hoare triple {201#false} assume 0 == ~cond; {201#false} is VALID [2020-07-17 22:49:40,988 INFO L280 TraceCheckUtils]: 20: Hoare triple {201#false} assume !false; {201#false} is VALID [2020-07-17 22:49:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:40,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231121744] [2020-07-17 22:49:40,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:40,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:40,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033400051] [2020-07-17 22:49:40,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-17 22:49:40,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:40,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:41,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:41,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:41,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:41,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:41,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:41,024 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2020-07-17 22:49:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:41,347 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-17 22:49:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:41,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-17 22:49:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-17 22:49:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-17 22:49:41,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2020-07-17 22:49:41,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:41,421 INFO L225 Difference]: With dead ends: 40 [2020-07-17 22:49:41,421 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:49:41,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:49:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:49:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-07-17 22:49:41,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:41,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2020-07-17 22:49:41,463 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2020-07-17 22:49:41,463 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2020-07-17 22:49:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:41,468 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:49:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:49:41,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:41,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:41,472 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2020-07-17 22:49:41,472 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2020-07-17 22:49:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:41,476 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:49:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:49:41,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:41,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:41,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:41,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:49:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-17 22:49:41,484 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2020-07-17 22:49:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:41,489 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-17 22:49:41,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:49:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:49:41,491 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:41,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:41,491 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:49:41,491 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash -445719797, now seen corresponding path program 1 times [2020-07-17 22:49:41,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:41,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034276457] [2020-07-17 22:49:41,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:41,988 INFO L280 TraceCheckUtils]: 0: Hoare triple {389#(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; {371#true} is VALID [2020-07-17 22:49:41,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-17 22:49:41,998 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-17 22:49:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:42,018 INFO L280 TraceCheckUtils]: 0: Hoare triple {371#true} ~cond := #in~cond; {371#true} is VALID [2020-07-17 22:49:42,018 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} assume !(0 == ~cond); {371#true} is VALID [2020-07-17 22:49:42,019 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-17 22:49:42,022 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:42,024 INFO L263 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {389#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:42,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {389#(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; {371#true} is VALID [2020-07-17 22:49:42,024 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-17 22:49:42,025 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-17 22:49:42,025 INFO L263 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(); {371#true} is VALID [2020-07-17 22:49:42,025 INFO L280 TraceCheckUtils]: 5: Hoare triple {371#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {371#true} is VALID [2020-07-17 22:49:42,026 INFO L280 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~N~0 <= 0); {376#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:42,027 INFO L263 TraceCheckUtils]: 7: Hoare triple {376#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {371#true} is VALID [2020-07-17 22:49:42,027 INFO L280 TraceCheckUtils]: 8: Hoare triple {371#true} ~cond := #in~cond; {371#true} is VALID [2020-07-17 22:49:42,027 INFO L280 TraceCheckUtils]: 9: Hoare triple {371#true} assume !(0 == ~cond); {371#true} is VALID [2020-07-17 22:49:42,027 INFO L280 TraceCheckUtils]: 10: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-17 22:49:42,029 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {371#true} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:42,032 INFO L280 TraceCheckUtils]: 12: Hoare triple {376#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {381#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-17 22:49:42,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {381#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {381#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-17 22:49:42,035 INFO L280 TraceCheckUtils]: 14: Hoare triple {381#(and (= 0 main_~i~0) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {382#(and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-17 22:49:42,036 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#(and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume !(~i~0 < ~N~0); {383#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-17 22:49:42,038 INFO L280 TraceCheckUtils]: 16: Hoare triple {383#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} ~i~0 := 0; {383#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-17 22:49:42,039 INFO L280 TraceCheckUtils]: 17: Hoare triple {383#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {384#(and (or (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (not (= main_~a~0.base |main_~#sum~0.base|)) (or (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (* 3 ~N~0)) (not (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-17 22:49:42,041 INFO L280 TraceCheckUtils]: 18: Hoare triple {384#(and (or (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (not (= main_~a~0.base |main_~#sum~0.base|)) (or (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (* 3 ~N~0)) (not (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume 2 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 3 ~N~0))} is VALID [2020-07-17 22:49:42,042 INFO L280 TraceCheckUtils]: 19: Hoare triple {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 3 ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 3 ~N~0))} is VALID [2020-07-17 22:49:42,043 INFO L280 TraceCheckUtils]: 20: Hoare triple {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 3 ~N~0))} assume !(~i~0 < ~N~0); {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 3 ~N~0))} is VALID [2020-07-17 22:49:42,044 INFO L280 TraceCheckUtils]: 21: Hoare triple {385#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 3 ~N~0))} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {386#(= |main_#t~mem9| (* 3 ~N~0))} is VALID [2020-07-17 22:49:42,045 INFO L263 TraceCheckUtils]: 22: Hoare triple {386#(= |main_#t~mem9| (* 3 ~N~0))} call __VERIFIER_assert((if #t~mem9 == 3 * ~N~0 then 1 else 0)); {387#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:49:42,046 INFO L280 TraceCheckUtils]: 23: Hoare triple {387#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {388#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:49:42,047 INFO L280 TraceCheckUtils]: 24: Hoare triple {388#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {372#false} is VALID [2020-07-17 22:49:42,047 INFO L280 TraceCheckUtils]: 25: Hoare triple {372#false} assume !false; {372#false} is VALID [2020-07-17 22:49:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:42,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034276457] [2020-07-17 22:49:42,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872805848] [2020-07-17 22:49:42,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:42,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-17 22:49:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:42,118 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:42,237 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 22:49:42,238 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:42,248 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:42,249 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:42,249 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-07-17 22:49:42,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:42,311 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-17 22:49:42,313 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:42,325 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:42,326 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:42,326 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-17 22:49:42,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:42,743 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:42,744 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 1 case distinctions, treesize of input 55 treesize of output 57 [2020-07-17 22:49:42,751 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:42,788 INFO L624 ElimStorePlain]: treesize reduction 30, result has 63.4 percent of original size [2020-07-17 22:49:42,809 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-17 22:49:42,809 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:52 [2020-07-17 22:49:42,820 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:42,820 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, main_~a~0.base, main_~i~0, main_~a~0.offset, v_main_~i~0_15]. (let ((.cse2 (select |v_#memory_int_15| main_~a~0.base)) (.cse3 (select |v_#memory_int_15| |main_~#sum~0.base|))) (let ((.cse0 (select .cse3 |main_~#sum~0.offset|)) (.cse1 (select .cse2 (+ (* main_~i~0 4) main_~a~0.offset)))) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (<= 1 ~N~0) (= 1 .cse0) (= 2 .cse1) (= 2 (select .cse2 (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (= (store |v_#memory_int_15| |main_~#sum~0.base| (store .cse3 |main_~#sum~0.offset| (+ .cse0 .cse1))) |#memory_int|) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|)))) [2020-07-17 22:49:42,821 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~a~0.base, main_~i~0, main_~a~0.offset, v_main_~i~0_15]. (let ((.cse0 (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (.cse1 (select |#memory_int| main_~a~0.base))) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= .cse0 3) (= 2 (select .cse1 (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= .cse0 (+ (select .cse1 (+ (* main_~i~0 4) main_~a~0.offset)) 1)) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) [2020-07-17 22:49:43,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:43,123 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:43,123 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2020-07-17 22:49:43,127 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:43,154 INFO L624 ElimStorePlain]: treesize reduction 18, result has 52.6 percent of original size [2020-07-17 22:49:43,165 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:43,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:59, output treesize:10 [2020-07-17 22:49:43,169 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:43,169 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~a~0.base, main_~i~0, main_~a~0.offset, |main_~#sum~0.base|, |main_~#sum~0.offset|, v_main_~i~0_15]. (let ((.cse1 (select |#memory_int| main_~a~0.base)) (.cse0 (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= .cse0 3) (= 2 (select .cse1 (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= .cse0 (+ (select .cse1 (+ (* main_~i~0 4) main_~a~0.offset)) 1)) (= .cse0 |main_#t~mem9|) (<= 1 ~N~0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) [2020-07-17 22:49:43,170 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 3 |main_#t~mem9|) (<= ~N~0 1) (<= 1 ~N~0)) [2020-07-17 22:49:43,225 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:49:43,291 INFO L263 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {371#true} is VALID [2020-07-17 22:49:43,291 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {371#true} is VALID [2020-07-17 22:49:43,291 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-17 22:49:43,292 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-17 22:49:43,292 INFO L263 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(); {371#true} is VALID [2020-07-17 22:49:43,292 INFO L280 TraceCheckUtils]: 5: Hoare triple {371#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {371#true} is VALID [2020-07-17 22:49:43,293 INFO L280 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~N~0 <= 0); {376#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:43,294 INFO L263 TraceCheckUtils]: 7: Hoare triple {376#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {376#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:43,295 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#(<= 1 ~N~0)} ~cond := #in~cond; {376#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:43,296 INFO L280 TraceCheckUtils]: 9: Hoare triple {376#(<= 1 ~N~0)} assume !(0 == ~cond); {376#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:43,297 INFO L280 TraceCheckUtils]: 10: Hoare triple {376#(<= 1 ~N~0)} assume true; {376#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:43,298 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {376#(<= 1 ~N~0)} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:43,300 INFO L280 TraceCheckUtils]: 12: Hoare triple {376#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {429#(and (<= main_~i~0 0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:49:43,302 INFO L280 TraceCheckUtils]: 13: Hoare triple {429#(and (<= main_~i~0 0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {433#(and (<= main_~i~0 0) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:49:43,305 INFO L280 TraceCheckUtils]: 14: Hoare triple {433#(and (<= main_~i~0 0) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {437#(and (exists ((v_main_~i~0_15 Int)) (and (<= main_~i~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:49:43,308 INFO L280 TraceCheckUtils]: 15: Hoare triple {437#(and (exists ((v_main_~i~0_15 Int)) (and (<= main_~i~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !(~i~0 < ~N~0); {441#(and (<= 1 ~N~0) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:49:43,309 INFO L280 TraceCheckUtils]: 16: Hoare triple {441#(and (<= 1 ~N~0) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} ~i~0 := 0; {441#(and (<= 1 ~N~0) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:49:43,311 INFO L280 TraceCheckUtils]: 17: Hoare triple {441#(and (<= 1 ~N~0) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {448#(and (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:49:44,483 INFO L280 TraceCheckUtils]: 18: Hoare triple {448#(and (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume 2 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) 1)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3) (<= 1 ~N~0))} is UNKNOWN [2020-07-17 22:49:44,485 INFO L280 TraceCheckUtils]: 19: Hoare triple {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) 1)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3) (<= 1 ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) 1)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:44,486 INFO L280 TraceCheckUtils]: 20: Hoare triple {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) 1)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) 1)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:44,488 INFO L280 TraceCheckUtils]: 21: Hoare triple {452#(and (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) 1)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3) (<= 1 ~N~0))} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {462#(and (= 3 |main_#t~mem9|) (<= ~N~0 1) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:44,489 INFO L263 TraceCheckUtils]: 22: Hoare triple {462#(and (= 3 |main_#t~mem9|) (<= ~N~0 1) (<= 1 ~N~0))} call __VERIFIER_assert((if #t~mem9 == 3 * ~N~0 then 1 else 0)); {466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:49:44,490 INFO L280 TraceCheckUtils]: 23: Hoare triple {466#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:49:44,490 INFO L280 TraceCheckUtils]: 24: Hoare triple {470#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {372#false} is VALID [2020-07-17 22:49:44,490 INFO L280 TraceCheckUtils]: 25: Hoare triple {372#false} assume !false; {372#false} is VALID [2020-07-17 22:49:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:44,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:49:44,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-07-17 22:49:44,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610074688] [2020-07-17 22:49:44,496 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2020-07-17 22:49:44,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:44,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-17 22:49:47,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:47,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 22:49:47,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:47,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 22:49:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:49:47,497 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 21 states. [2020-07-17 22:49:49,043 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-07-17 22:49:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:49,435 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2020-07-17 22:49:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:49:49,435 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2020-07-17 22:49:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:49:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2020-07-17 22:49:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:49:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2020-07-17 22:49:49,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 55 transitions. [2020-07-17 22:49:51,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 54 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:51,620 INFO L225 Difference]: With dead ends: 49 [2020-07-17 22:49:51,620 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:49:51,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2020-07-17 22:49:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:49:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-17 22:49:51,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:51,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2020-07-17 22:49:51,660 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2020-07-17 22:49:51,660 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2020-07-17 22:49:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:51,663 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-17 22:49:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-17 22:49:51,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:51,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:51,665 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2020-07-17 22:49:51,665 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2020-07-17 22:49:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:51,668 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-17 22:49:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-17 22:49:51,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:51,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:51,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:51,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:49:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-17 22:49:51,673 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 26 [2020-07-17 22:49:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:51,674 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-17 22:49:51,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 22:49:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-17 22:49:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:49:51,675 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:51,681 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:51,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:49:51,895 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:51,896 INFO L82 PathProgramCache]: Analyzing trace with hash 531279049, now seen corresponding path program 2 times [2020-07-17 22:49:51,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:51,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439738753] [2020-07-17 22:49:51,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:52,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {697#(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; {683#true} is VALID [2020-07-17 22:49:52,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-17 22:49:52,037 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {683#true} {683#true} #72#return; {683#true} is VALID [2020-07-17 22:49:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:52,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-17 22:49:52,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-17 22:49:52,043 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-17 22:49:52,044 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #68#return; {683#true} is VALID [2020-07-17 22:49:52,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {697#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:52,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {697#(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; {683#true} is VALID [2020-07-17 22:49:52,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-17 22:49:52,046 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #72#return; {683#true} is VALID [2020-07-17 22:49:52,046 INFO L263 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret10 := main(); {683#true} is VALID [2020-07-17 22:49:52,046 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {683#true} is VALID [2020-07-17 22:49:52,047 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} assume !(~N~0 <= 0); {683#true} is VALID [2020-07-17 22:49:52,047 INFO L263 TraceCheckUtils]: 7: Hoare triple {683#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {683#true} is VALID [2020-07-17 22:49:52,047 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-17 22:49:52,047 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-17 22:49:52,048 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-17 22:49:52,048 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {683#true} {683#true} #68#return; {683#true} is VALID [2020-07-17 22:49:52,049 INFO L280 TraceCheckUtils]: 12: Hoare triple {683#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {692#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:52,050 INFO L280 TraceCheckUtils]: 13: Hoare triple {692#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {692#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:52,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {692#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {693#(<= 1 main_~i~0)} is VALID [2020-07-17 22:49:52,051 INFO L280 TraceCheckUtils]: 15: Hoare triple {693#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {694#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:52,052 INFO L280 TraceCheckUtils]: 16: Hoare triple {694#(<= 2 ~N~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {694#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:52,052 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {694#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:52,053 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#(<= 2 ~N~0)} ~i~0 := 0; {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:52,053 INFO L280 TraceCheckUtils]: 19: Hoare triple {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:52,054 INFO L280 TraceCheckUtils]: 20: Hoare triple {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} assume 2 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:52,055 INFO L280 TraceCheckUtils]: 21: Hoare triple {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {696#(<= (+ main_~i~0 1) ~N~0)} is VALID [2020-07-17 22:49:52,056 INFO L280 TraceCheckUtils]: 22: Hoare triple {696#(<= (+ main_~i~0 1) ~N~0)} assume !(~i~0 < ~N~0); {684#false} is VALID [2020-07-17 22:49:52,056 INFO L280 TraceCheckUtils]: 23: Hoare triple {684#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {684#false} is VALID [2020-07-17 22:49:52,056 INFO L263 TraceCheckUtils]: 24: Hoare triple {684#false} call __VERIFIER_assert((if #t~mem9 == 3 * ~N~0 then 1 else 0)); {684#false} is VALID [2020-07-17 22:49:52,057 INFO L280 TraceCheckUtils]: 25: Hoare triple {684#false} ~cond := #in~cond; {684#false} is VALID [2020-07-17 22:49:52,057 INFO L280 TraceCheckUtils]: 26: Hoare triple {684#false} assume 0 == ~cond; {684#false} is VALID [2020-07-17 22:49:52,057 INFO L280 TraceCheckUtils]: 27: Hoare triple {684#false} assume !false; {684#false} is VALID [2020-07-17 22:49:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:52,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439738753] [2020-07-17 22:49:52,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037146934] [2020-07-17 22:49:52,060 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:52,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:49:52,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:49:52,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:49:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:52,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:52,245 INFO L263 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2020-07-17 22:49:52,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {683#true} is VALID [2020-07-17 22:49:52,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-17 22:49:52,246 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #72#return; {683#true} is VALID [2020-07-17 22:49:52,246 INFO L263 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret10 := main(); {683#true} is VALID [2020-07-17 22:49:52,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {683#true} is VALID [2020-07-17 22:49:52,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} assume !(~N~0 <= 0); {683#true} is VALID [2020-07-17 22:49:52,247 INFO L263 TraceCheckUtils]: 7: Hoare triple {683#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {683#true} is VALID [2020-07-17 22:49:52,247 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-17 22:49:52,247 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-17 22:49:52,248 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-17 22:49:52,248 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {683#true} {683#true} #68#return; {683#true} is VALID [2020-07-17 22:49:52,249 INFO L280 TraceCheckUtils]: 12: Hoare triple {683#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {737#(<= 0 main_~i~0)} is VALID [2020-07-17 22:49:52,250 INFO L280 TraceCheckUtils]: 13: Hoare triple {737#(<= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {737#(<= 0 main_~i~0)} is VALID [2020-07-17 22:49:52,253 INFO L280 TraceCheckUtils]: 14: Hoare triple {737#(<= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {693#(<= 1 main_~i~0)} is VALID [2020-07-17 22:49:52,254 INFO L280 TraceCheckUtils]: 15: Hoare triple {693#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {694#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:52,256 INFO L280 TraceCheckUtils]: 16: Hoare triple {694#(<= 2 ~N~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {694#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:52,258 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {694#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:52,259 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#(<= 2 ~N~0)} ~i~0 := 0; {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-17 22:49:52,260 INFO L280 TraceCheckUtils]: 19: Hoare triple {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-17 22:49:52,262 INFO L280 TraceCheckUtils]: 20: Hoare triple {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} assume 2 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-17 22:49:52,265 INFO L280 TraceCheckUtils]: 21: Hoare triple {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {766#(and (<= 2 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:49:52,266 INFO L280 TraceCheckUtils]: 22: Hoare triple {766#(and (<= 2 ~N~0) (<= main_~i~0 1))} assume !(~i~0 < ~N~0); {684#false} is VALID [2020-07-17 22:49:52,266 INFO L280 TraceCheckUtils]: 23: Hoare triple {684#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {684#false} is VALID [2020-07-17 22:49:52,267 INFO L263 TraceCheckUtils]: 24: Hoare triple {684#false} call __VERIFIER_assert((if #t~mem9 == 3 * ~N~0 then 1 else 0)); {684#false} is VALID [2020-07-17 22:49:52,267 INFO L280 TraceCheckUtils]: 25: Hoare triple {684#false} ~cond := #in~cond; {684#false} is VALID [2020-07-17 22:49:52,267 INFO L280 TraceCheckUtils]: 26: Hoare triple {684#false} assume 0 == ~cond; {684#false} is VALID [2020-07-17 22:49:52,267 INFO L280 TraceCheckUtils]: 27: Hoare triple {684#false} assume !false; {684#false} is VALID [2020-07-17 22:49:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:52,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:49:52,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-17 22:49:52,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539013893] [2020-07-17 22:49:52,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:49:52,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:52,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:49:52,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:52,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:49:52,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:49:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:49:52,322 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2020-07-17 22:49:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:52,964 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-17 22:49:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:49:52,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:49:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:49:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-17 22:49:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:49:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-17 22:49:52,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2020-07-17 22:49:53,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:53,049 INFO L225 Difference]: With dead ends: 45 [2020-07-17 22:49:53,050 INFO L226 Difference]: Without dead ends: 39 [2020-07-17 22:49:53,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:49:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-17 22:49:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-07-17 22:49:53,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:53,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2020-07-17 22:49:53,097 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2020-07-17 22:49:53,097 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2020-07-17 22:49:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:53,101 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-17 22:49:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-17 22:49:53,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:53,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:53,103 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2020-07-17 22:49:53,103 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2020-07-17 22:49:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:53,106 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-17 22:49:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-17 22:49:53,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:53,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:53,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:53,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:49:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-17 22:49:53,109 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2020-07-17 22:49:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:53,109 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-17 22:49:53,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:49:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:49:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:49:53,111 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:53,111 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] [2020-07-17 22:49:53,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:53,325 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1018004383, now seen corresponding path program 3 times [2020-07-17 22:49:53,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:53,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647091065] [2020-07-17 22:49:53,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:53,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {999#(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; {985#true} is VALID [2020-07-17 22:49:53,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-17 22:49:53,450 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {985#true} {985#true} #72#return; {985#true} is VALID [2020-07-17 22:49:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:53,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-17 22:49:53,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-17 22:49:53,457 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-17 22:49:53,457 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #68#return; {985#true} is VALID [2020-07-17 22:49:53,458 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:53,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {999#(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; {985#true} is VALID [2020-07-17 22:49:53,459 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-17 22:49:53,459 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #72#return; {985#true} is VALID [2020-07-17 22:49:53,459 INFO L263 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret10 := main(); {985#true} is VALID [2020-07-17 22:49:53,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {985#true} is VALID [2020-07-17 22:49:53,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume !(~N~0 <= 0); {985#true} is VALID [2020-07-17 22:49:53,459 INFO L263 TraceCheckUtils]: 7: Hoare triple {985#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {985#true} is VALID [2020-07-17 22:49:53,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-17 22:49:53,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-17 22:49:53,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-17 22:49:53,460 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {985#true} {985#true} #68#return; {985#true} is VALID [2020-07-17 22:49:53,461 INFO L280 TraceCheckUtils]: 12: Hoare triple {985#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {994#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:53,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {994#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {994#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:53,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {994#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {995#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:53,463 INFO L280 TraceCheckUtils]: 15: Hoare triple {995#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {996#(<= ~N~0 1)} is VALID [2020-07-17 22:49:53,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {996#(<= ~N~0 1)} ~i~0 := 0; {997#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:53,464 INFO L280 TraceCheckUtils]: 17: Hoare triple {997#(and (<= ~N~0 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {997#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:53,465 INFO L280 TraceCheckUtils]: 18: Hoare triple {997#(and (<= ~N~0 1) (= 0 main_~i~0))} assume 2 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {997#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:53,466 INFO L280 TraceCheckUtils]: 19: Hoare triple {997#(and (<= ~N~0 1) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {998#(<= ~N~0 main_~i~0)} is VALID [2020-07-17 22:49:53,467 INFO L280 TraceCheckUtils]: 20: Hoare triple {998#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {986#false} is VALID [2020-07-17 22:49:53,467 INFO L280 TraceCheckUtils]: 21: Hoare triple {986#false} assume 2 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {986#false} is VALID [2020-07-17 22:49:53,467 INFO L280 TraceCheckUtils]: 22: Hoare triple {986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {986#false} is VALID [2020-07-17 22:49:53,467 INFO L280 TraceCheckUtils]: 23: Hoare triple {986#false} assume !(~i~0 < ~N~0); {986#false} is VALID [2020-07-17 22:49:53,468 INFO L280 TraceCheckUtils]: 24: Hoare triple {986#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {986#false} is VALID [2020-07-17 22:49:53,468 INFO L263 TraceCheckUtils]: 25: Hoare triple {986#false} call __VERIFIER_assert((if #t~mem9 == 3 * ~N~0 then 1 else 0)); {986#false} is VALID [2020-07-17 22:49:53,468 INFO L280 TraceCheckUtils]: 26: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-17 22:49:53,468 INFO L280 TraceCheckUtils]: 27: Hoare triple {986#false} assume 0 == ~cond; {986#false} is VALID [2020-07-17 22:49:53,469 INFO L280 TraceCheckUtils]: 28: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-17 22:49:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:53,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647091065] [2020-07-17 22:49:53,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754970609] [2020-07-17 22:49:53,471 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:53,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:49:53,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:49:53,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:49:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:53,533 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:53,638 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2020-07-17 22:49:53,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {985#true} is VALID [2020-07-17 22:49:53,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-17 22:49:53,639 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #72#return; {985#true} is VALID [2020-07-17 22:49:53,639 INFO L263 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret10 := main(); {985#true} is VALID [2020-07-17 22:49:53,639 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {985#true} is VALID [2020-07-17 22:49:53,640 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume !(~N~0 <= 0); {985#true} is VALID [2020-07-17 22:49:53,640 INFO L263 TraceCheckUtils]: 7: Hoare triple {985#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {985#true} is VALID [2020-07-17 22:49:53,640 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-17 22:49:53,640 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-17 22:49:53,641 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-17 22:49:53,641 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {985#true} {985#true} #68#return; {985#true} is VALID [2020-07-17 22:49:53,642 INFO L280 TraceCheckUtils]: 12: Hoare triple {985#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {1039#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:53,642 INFO L280 TraceCheckUtils]: 13: Hoare triple {1039#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1039#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:53,643 INFO L280 TraceCheckUtils]: 14: Hoare triple {1039#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {995#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:53,644 INFO L280 TraceCheckUtils]: 15: Hoare triple {995#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {996#(<= ~N~0 1)} is VALID [2020-07-17 22:49:53,644 INFO L280 TraceCheckUtils]: 16: Hoare triple {996#(<= ~N~0 1)} ~i~0 := 0; {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:53,645 INFO L280 TraceCheckUtils]: 17: Hoare triple {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:53,646 INFO L280 TraceCheckUtils]: 18: Hoare triple {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume 2 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:53,647 INFO L280 TraceCheckUtils]: 19: Hoare triple {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1062#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:53,648 INFO L280 TraceCheckUtils]: 20: Hoare triple {1062#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {986#false} is VALID [2020-07-17 22:49:53,648 INFO L280 TraceCheckUtils]: 21: Hoare triple {986#false} assume 2 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {986#false} is VALID [2020-07-17 22:49:53,649 INFO L280 TraceCheckUtils]: 22: Hoare triple {986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {986#false} is VALID [2020-07-17 22:49:53,649 INFO L280 TraceCheckUtils]: 23: Hoare triple {986#false} assume !(~i~0 < ~N~0); {986#false} is VALID [2020-07-17 22:49:53,649 INFO L280 TraceCheckUtils]: 24: Hoare triple {986#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {986#false} is VALID [2020-07-17 22:49:53,649 INFO L263 TraceCheckUtils]: 25: Hoare triple {986#false} call __VERIFIER_assert((if #t~mem9 == 3 * ~N~0 then 1 else 0)); {986#false} is VALID [2020-07-17 22:49:53,649 INFO L280 TraceCheckUtils]: 26: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-17 22:49:53,649 INFO L280 TraceCheckUtils]: 27: Hoare triple {986#false} assume 0 == ~cond; {986#false} is VALID [2020-07-17 22:49:53,650 INFO L280 TraceCheckUtils]: 28: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-17 22:49:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:53,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:49:53,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-17 22:49:53,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330953478] [2020-07-17 22:49:53,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-17 22:49:53,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:53,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:49:53,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:53,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:49:53,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:53,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:49:53,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:49:53,704 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 11 states. [2020-07-17 22:49:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:54,172 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-17 22:49:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:49:54,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-17 22:49:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:49:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-17 22:49:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:49:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-17 22:49:54,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2020-07-17 22:49:54,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:54,250 INFO L225 Difference]: With dead ends: 49 [2020-07-17 22:49:54,250 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:49:54,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:49:54,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:49:54,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-17 22:49:54,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:54,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-17 22:49:54,301 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-17 22:49:54,301 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-17 22:49:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:54,303 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:49:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:49:54,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:54,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:54,304 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-17 22:49:54,304 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-17 22:49:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:54,306 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:49:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:49:54,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:54,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:54,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:54,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:49:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-17 22:49:54,309 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2020-07-17 22:49:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:54,310 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-17 22:49:54,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:49:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-17 22:49:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:49:54,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:54,311 INFO L422 BasicCegarLoop]: trace histogram [2, 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] [2020-07-17 22:49:54,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:54,526 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:54,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:54,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2056219107, now seen corresponding path program 4 times [2020-07-17 22:49:54,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:54,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697579655] [2020-07-17 22:49:54,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:54,607 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:54,607 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:54,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:49:54,646 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:54,646 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:54,647 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:54,647 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:54,647 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:54,647 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:54,647 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:54,647 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:54,647 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:54,647 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:54,647 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:54,648 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:54,648 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:54,648 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:54,648 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:54,648 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:54,648 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:54,648 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:54,648 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:54,649 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:54,649 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:54,649 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:54,649 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:54,649 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:54,649 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:54,649 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:54,650 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:54,650 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:54,650 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:54,650 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:54,650 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:54,650 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-17 22:49:54,650 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-17 22:49:54,651 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-17 22:49:54,651 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:54,651 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:54,651 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:54,651 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-17 22:49:54,651 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:49:54,651 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:49:54,652 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:49:54,652 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:49:54,652 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:49:54,652 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:49:54,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:54 BoogieIcfgContainer [2020-07-17 22:49:54,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:54,657 INFO L168 Benchmark]: Toolchain (without parser) took 15585.27 ms. Allocated memory was 143.7 MB in the beginning and 304.6 MB in the end (delta: 161.0 MB). Free memory was 100.9 MB in the beginning and 104.0 MB in the end (delta: -3.1 MB). Peak memory consumption was 157.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:54,658 INFO L168 Benchmark]: CDTParser took 0.68 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:54,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.40 ms. Allocated memory is still 143.7 MB. Free memory was 100.5 MB in the beginning and 89.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:54,660 INFO L168 Benchmark]: Boogie Preprocessor took 136.98 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 89.6 MB in the beginning and 178.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:54,660 INFO L168 Benchmark]: RCFGBuilder took 446.85 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 154.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:54,661 INFO L168 Benchmark]: TraceAbstraction took 14710.37 ms. Allocated memory was 201.3 MB in the beginning and 304.6 MB in the end (delta: 103.3 MB). Free memory was 153.8 MB in the beginning and 104.0 MB in the end (delta: 49.8 MB). Peak memory consumption was 153.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:54,666 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.68 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.40 ms. Allocated memory is still 143.7 MB. Free memory was 100.5 MB in the beginning and 89.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 136.98 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 89.6 MB in the beginning and 178.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 446.85 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 154.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14710.37 ms. Allocated memory was 201.3 MB in the beginning and 304.6 MB in the end (delta: 103.3 MB). Free memory was 153.8 MB in the beginning and 104.0 MB in the end (delta: 49.8 MB). Peak memory consumption was 153.1 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)=10, 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 sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 1 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=2, sum={7:0}] [L30] COND TRUE i