/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/condgf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:04,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:04,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:04,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:04,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:04,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:04,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:04,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:04,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:04,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:04,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:04,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:04,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:04,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:04,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:04,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:04,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:04,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:04,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:04,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:04,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:04,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:04,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:04,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:04,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:04,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:04,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:04,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:04,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:04,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:04,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:04,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:04,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:04,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:04,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:04,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:04,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:04,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:04,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:04,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:04,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:04,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:04,553 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:04,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:04,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:04,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:04,558 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:04,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:04,558 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:04,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:04,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:04,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:04,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:04,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:04,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:04,561 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:04,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:04,561 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:04,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:04,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:04,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:04,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:04,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:04,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:04,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:04,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:04,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:04,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:04,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:04,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:04,564 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:04,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:04,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:04,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:04,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:04,871 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:04,871 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:04,872 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condgf.c [2020-07-10 15:26:04,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c25eae790/94c08872c68a4308aca848c3809abadf/FLAGfc92e6dd3 [2020-07-10 15:26:05,397 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:05,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condgf.c [2020-07-10 15:26:05,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c25eae790/94c08872c68a4308aca848c3809abadf/FLAGfc92e6dd3 [2020-07-10 15:26:05,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c25eae790/94c08872c68a4308aca848c3809abadf [2020-07-10 15:26:05,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:05,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:05,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:05,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:05,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:05,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:05" (1/1) ... [2020-07-10 15:26:05,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a160cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:05, skipping insertion in model container [2020-07-10 15:26:05,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:05" (1/1) ... [2020-07-10 15:26:05,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:05,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:06,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:06,038 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:06,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:06,077 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:06,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06 WrapperNode [2020-07-10 15:26:06,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:06,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:06,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:06,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:06,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06" (1/1) ... [2020-07-10 15:26:06,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06" (1/1) ... [2020-07-10 15:26:06,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06" (1/1) ... [2020-07-10 15:26:06,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06" (1/1) ... [2020-07-10 15:26:06,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06" (1/1) ... [2020-07-10 15:26:06,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06" (1/1) ... [2020-07-10 15:26:06,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06" (1/1) ... [2020-07-10 15:26:06,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:06,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:06,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:06,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:06,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:06,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:06,690 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:06,690 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 15:26:06,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:06 BoogieIcfgContainer [2020-07-10 15:26:06,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:06,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:06,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:06,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:06,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:05" (1/3) ... [2020-07-10 15:26:06,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be8ec09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:06, skipping insertion in model container [2020-07-10 15:26:06,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06" (2/3) ... [2020-07-10 15:26:06,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be8ec09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:06, skipping insertion in model container [2020-07-10 15:26:06,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:06" (3/3) ... [2020-07-10 15:26:06,706 INFO L109 eAbstractionObserver]: Analyzing ICFG condgf.c [2020-07-10 15:26:06,715 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:06,722 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:06,735 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:06,756 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:06,756 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:06,757 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:06,757 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:06,757 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:06,757 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:06,757 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:06,757 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-10 15:26:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:26:06,779 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:06,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:06,781 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:06,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1314310818, now seen corresponding path program 1 times [2020-07-10 15:26:06,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:06,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669450929] [2020-07-10 15:26:06,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#(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; {41#true} is VALID [2020-07-10 15:26:07,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-10 15:26:07,037 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #100#return; {41#true} is VALID [2020-07-10 15:26:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,056 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2020-07-10 15:26:07,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2020-07-10 15:26:07,058 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2020-07-10 15:26:07,059 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #96#return; {42#false} is VALID [2020-07-10 15:26:07,061 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:07,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#(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; {41#true} is VALID [2020-07-10 15:26:07,062 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-10 15:26:07,063 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #100#return; {41#true} is VALID [2020-07-10 15:26:07,063 INFO L263 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret12 := main(); {41#true} is VALID [2020-07-10 15:26:07,063 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {41#true} is VALID [2020-07-10 15:26:07,064 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} assume !(~N~0 <= 0); {41#true} is VALID [2020-07-10 15:26:07,064 INFO L263 TraceCheckUtils]: 7: Hoare triple {41#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {41#true} is VALID [2020-07-10 15:26:07,065 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2020-07-10 15:26:07,066 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2020-07-10 15:26:07,067 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#false} assume true; {42#false} is VALID [2020-07-10 15:26:07,070 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {42#false} {41#true} #96#return; {42#false} is VALID [2020-07-10 15:26:07,070 INFO L280 TraceCheckUtils]: 12: Hoare triple {42#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(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {42#false} is VALID [2020-07-10 15:26:07,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#false} assume !(~i~0 < ~N~0); {42#false} is VALID [2020-07-10 15:26:07,071 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2020-07-10 15:26:07,072 INFO L280 TraceCheckUtils]: 15: Hoare triple {42#false} assume !(~i~0 < ~N~0); {42#false} is VALID [2020-07-10 15:26:07,072 INFO L280 TraceCheckUtils]: 16: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2020-07-10 15:26:07,072 INFO L280 TraceCheckUtils]: 17: Hoare triple {42#false} assume !(~i~0 < ~N~0); {42#false} is VALID [2020-07-10 15:26:07,073 INFO L280 TraceCheckUtils]: 18: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2020-07-10 15:26:07,073 INFO L280 TraceCheckUtils]: 19: Hoare triple {42#false} assume !!(~i~0 < ~N~0);call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {42#false} is VALID [2020-07-10 15:26:07,073 INFO L263 TraceCheckUtils]: 20: Hoare triple {42#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {42#false} is VALID [2020-07-10 15:26:07,074 INFO L280 TraceCheckUtils]: 21: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2020-07-10 15:26:07,074 INFO L280 TraceCheckUtils]: 22: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2020-07-10 15:26:07,075 INFO L280 TraceCheckUtils]: 23: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-10 15:26:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:07,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669450929] [2020-07-10 15:26:07,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:07,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:07,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267232073] [2020-07-10 15:26:07,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:26:07,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:07,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:07,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:07,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:07,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:07,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:07,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:07,174 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-07-10 15:26:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,394 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2020-07-10 15:26:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:07,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:26:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-10 15:26:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-10 15:26:07,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2020-07-10 15:26:07,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:07,584 INFO L225 Difference]: With dead ends: 66 [2020-07-10 15:26:07,584 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 15:26:07,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 15:26:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-10 15:26:07,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:07,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-10 15:26:07,644 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 15:26:07,644 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 15:26:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,649 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 15:26:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:26:07,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:07,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:07,650 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 15:26:07,650 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 15:26:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,655 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 15:26:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:26:07,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:07,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:07,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:07,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:26:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-10 15:26:07,661 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2020-07-10 15:26:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:07,662 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-10 15:26:07,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:26:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:26:07,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:07,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:07,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:07,664 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash 34447140, now seen corresponding path program 1 times [2020-07-10 15:26:07,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:07,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287460459] [2020-07-10 15:26:07,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,821 INFO L280 TraceCheckUtils]: 0: Hoare triple {259#(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; {248#true} is VALID [2020-07-10 15:26:07,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {248#true} assume true; {248#true} is VALID [2020-07-10 15:26:07,822 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {248#true} {248#true} #100#return; {248#true} is VALID [2020-07-10 15:26:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {248#true} ~cond := #in~cond; {248#true} is VALID [2020-07-10 15:26:07,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {248#true} assume !(0 == ~cond); {248#true} is VALID [2020-07-10 15:26:07,831 INFO L280 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2020-07-10 15:26:07,832 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {248#true} {253#(<= 1 ~N~0)} #96#return; {253#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:07,841 INFO L263 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {259#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:07,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {259#(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; {248#true} is VALID [2020-07-10 15:26:07,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2020-07-10 15:26:07,842 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {248#true} {248#true} #100#return; {248#true} is VALID [2020-07-10 15:26:07,843 INFO L263 TraceCheckUtils]: 4: Hoare triple {248#true} call #t~ret12 := main(); {248#true} is VALID [2020-07-10 15:26:07,843 INFO L280 TraceCheckUtils]: 5: Hoare triple {248#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {248#true} is VALID [2020-07-10 15:26:07,845 INFO L280 TraceCheckUtils]: 6: Hoare triple {248#true} assume !(~N~0 <= 0); {253#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:07,845 INFO L263 TraceCheckUtils]: 7: Hoare triple {253#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {248#true} is VALID [2020-07-10 15:26:07,846 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#true} ~cond := #in~cond; {248#true} is VALID [2020-07-10 15:26:07,846 INFO L280 TraceCheckUtils]: 9: Hoare triple {248#true} assume !(0 == ~cond); {248#true} is VALID [2020-07-10 15:26:07,846 INFO L280 TraceCheckUtils]: 10: Hoare triple {248#true} assume true; {248#true} is VALID [2020-07-10 15:26:07,847 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {248#true} {253#(<= 1 ~N~0)} #96#return; {253#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:07,853 INFO L280 TraceCheckUtils]: 12: Hoare triple {253#(<= 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(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {258#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:07,854 INFO L280 TraceCheckUtils]: 13: Hoare triple {258#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {249#false} is VALID [2020-07-10 15:26:07,854 INFO L280 TraceCheckUtils]: 14: Hoare triple {249#false} ~i~0 := 0; {249#false} is VALID [2020-07-10 15:26:07,855 INFO L280 TraceCheckUtils]: 15: Hoare triple {249#false} assume !(~i~0 < ~N~0); {249#false} is VALID [2020-07-10 15:26:07,855 INFO L280 TraceCheckUtils]: 16: Hoare triple {249#false} ~i~0 := 0; {249#false} is VALID [2020-07-10 15:26:07,855 INFO L280 TraceCheckUtils]: 17: Hoare triple {249#false} assume !(~i~0 < ~N~0); {249#false} is VALID [2020-07-10 15:26:07,855 INFO L280 TraceCheckUtils]: 18: Hoare triple {249#false} ~i~0 := 0; {249#false} is VALID [2020-07-10 15:26:07,856 INFO L280 TraceCheckUtils]: 19: Hoare triple {249#false} assume !!(~i~0 < ~N~0);call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {249#false} is VALID [2020-07-10 15:26:07,856 INFO L263 TraceCheckUtils]: 20: Hoare triple {249#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {249#false} is VALID [2020-07-10 15:26:07,856 INFO L280 TraceCheckUtils]: 21: Hoare triple {249#false} ~cond := #in~cond; {249#false} is VALID [2020-07-10 15:26:07,857 INFO L280 TraceCheckUtils]: 22: Hoare triple {249#false} assume 0 == ~cond; {249#false} is VALID [2020-07-10 15:26:07,857 INFO L280 TraceCheckUtils]: 23: Hoare triple {249#false} assume !false; {249#false} is VALID [2020-07-10 15:26:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:07,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287460459] [2020-07-10 15:26:07,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:07,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:07,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528498144] [2020-07-10 15:26:07,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:26:07,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:07,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:07,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:07,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:07,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:07,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:07,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:07,892 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2020-07-10 15:26:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,214 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2020-07-10 15:26:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:08,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-10 15:26:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-10 15:26:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-10 15:26:08,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2020-07-10 15:26:08,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:08,323 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:26:08,323 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 15:26:08,325 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-10 15:26:08,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 15:26:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2020-07-10 15:26:08,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:08,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2020-07-10 15:26:08,355 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2020-07-10 15:26:08,356 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2020-07-10 15:26:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,361 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-10 15:26:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-10 15:26:08,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:08,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:08,362 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2020-07-10 15:26:08,363 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2020-07-10 15:26:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,367 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-10 15:26:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-10 15:26:08,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:08,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:08,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:08,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:26:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-07-10 15:26:08,371 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2020-07-10 15:26:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:08,372 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-07-10 15:26:08,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 15:26:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:26:08,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:08,374 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, 1, 1, 1, 1, 1] [2020-07-10 15:26:08,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:08,374 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:08,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:08,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1408881596, now seen corresponding path program 1 times [2020-07-10 15:26:08,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:08,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532925534] [2020-07-10 15:26:08,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {504#(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; {488#true} is VALID [2020-07-10 15:26:08,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-10 15:26:08,933 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {488#true} {488#true} #100#return; {488#true} is VALID [2020-07-10 15:26:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {488#true} ~cond := #in~cond; {488#true} is VALID [2020-07-10 15:26:08,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} assume !(0 == ~cond); {488#true} is VALID [2020-07-10 15:26:08,939 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-10 15:26:08,940 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #96#return; {488#true} is VALID [2020-07-10 15:26:08,941 INFO L263 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {504#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:08,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {504#(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; {488#true} is VALID [2020-07-10 15:26:08,942 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-10 15:26:08,942 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #100#return; {488#true} is VALID [2020-07-10 15:26:08,943 INFO L263 TraceCheckUtils]: 4: Hoare triple {488#true} call #t~ret12 := main(); {488#true} is VALID [2020-07-10 15:26:08,943 INFO L280 TraceCheckUtils]: 5: Hoare triple {488#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {488#true} is VALID [2020-07-10 15:26:08,943 INFO L280 TraceCheckUtils]: 6: Hoare triple {488#true} assume !(~N~0 <= 0); {488#true} is VALID [2020-07-10 15:26:08,943 INFO L263 TraceCheckUtils]: 7: Hoare triple {488#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {488#true} is VALID [2020-07-10 15:26:08,944 INFO L280 TraceCheckUtils]: 8: Hoare triple {488#true} ~cond := #in~cond; {488#true} is VALID [2020-07-10 15:26:08,944 INFO L280 TraceCheckUtils]: 9: Hoare triple {488#true} assume !(0 == ~cond); {488#true} is VALID [2020-07-10 15:26:08,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-10 15:26:08,944 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {488#true} {488#true} #96#return; {488#true} is VALID [2020-07-10 15:26:08,946 INFO L280 TraceCheckUtils]: 12: Hoare triple {488#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(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {497#(and (= 0 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 2)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-10 15:26:08,948 INFO L280 TraceCheckUtils]: 13: Hoare triple {497#(and (= 0 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 2)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {498#(and (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:26:08,950 INFO L280 TraceCheckUtils]: 14: Hoare triple {498#(and (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {499#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (= 0 main_~a~0.offset) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:26:08,952 INFO L280 TraceCheckUtils]: 15: Hoare triple {499#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (= 0 main_~a~0.offset) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(~i~0 < ~N~0); {500#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (<= ~N~0 1) (= 0 main_~a~0.offset) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:26:08,954 INFO L280 TraceCheckUtils]: 16: Hoare triple {500#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (<= ~N~0 1) (= 0 main_~a~0.offset) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} ~i~0 := 0; {501#(and (not (= (+ (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|)) ~N~0)) (= 0 main_~a~0.offset) (= 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|) 0))} is VALID [2020-07-10 15:26:08,956 INFO L280 TraceCheckUtils]: 17: Hoare triple {501#(and (not (= (+ (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|)) ~N~0)) (= 0 main_~a~0.offset) (= 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|) 0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem4; {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} is VALID [2020-07-10 15:26:08,958 INFO L280 TraceCheckUtils]: 18: Hoare triple {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} is VALID [2020-07-10 15:26:08,961 INFO L280 TraceCheckUtils]: 19: Hoare triple {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} assume !(~i~0 < ~N~0); {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} is VALID [2020-07-10 15:26:08,961 INFO L280 TraceCheckUtils]: 20: Hoare triple {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} ~i~0 := 0; {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} is VALID [2020-07-10 15:26:08,962 INFO L280 TraceCheckUtils]: 21: Hoare triple {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {503#(not (= ~N~0 |main_#t~mem7|))} is VALID [2020-07-10 15:26:08,963 INFO L280 TraceCheckUtils]: 22: Hoare triple {503#(not (= ~N~0 |main_#t~mem7|))} assume #t~mem7 == ~N~0;havoc #t~mem7;call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8 - 1, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {489#false} is VALID [2020-07-10 15:26:08,964 INFO L280 TraceCheckUtils]: 23: Hoare triple {489#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {489#false} is VALID [2020-07-10 15:26:08,964 INFO L280 TraceCheckUtils]: 24: Hoare triple {489#false} assume !(~i~0 < ~N~0); {489#false} is VALID [2020-07-10 15:26:08,964 INFO L280 TraceCheckUtils]: 25: Hoare triple {489#false} ~i~0 := 0; {489#false} is VALID [2020-07-10 15:26:08,964 INFO L280 TraceCheckUtils]: 26: Hoare triple {489#false} assume !!(~i~0 < ~N~0);call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {489#false} is VALID [2020-07-10 15:26:08,965 INFO L263 TraceCheckUtils]: 27: Hoare triple {489#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {489#false} is VALID [2020-07-10 15:26:08,965 INFO L280 TraceCheckUtils]: 28: Hoare triple {489#false} ~cond := #in~cond; {489#false} is VALID [2020-07-10 15:26:08,965 INFO L280 TraceCheckUtils]: 29: Hoare triple {489#false} assume 0 == ~cond; {489#false} is VALID [2020-07-10 15:26:08,965 INFO L280 TraceCheckUtils]: 30: Hoare triple {489#false} assume !false; {489#false} is VALID [2020-07-10 15:26:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:08,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532925534] [2020-07-10 15:26:08,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128670623] [2020-07-10 15:26:08,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:09,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 15:26:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:09,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:09,144 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-10 15:26:09,145 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:09,154 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:09,154 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:09,155 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-07-10 15:26:09,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:09,206 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-10 15:26:09,208 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:09,218 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:09,219 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:09,219 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2020-07-10 15:26:09,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:09,423 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-07-10 15:26:09,429 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:09,438 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:09,441 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-10 15:26:09,441 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 [2020-07-10 15:26:09,447 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:09,448 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, main_~a~0.base, main_~a~0.offset]. (let ((.cse1 (select |v_#memory_int_17| |main_~#sum~0.base|))) (let ((.cse0 (select (select |v_#memory_int_17| main_~a~0.base) main_~a~0.offset)) (.cse2 (select .cse1 |main_~#sum~0.offset|))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_17| |main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| (+ .cse2 .cse0)))) (<= ~N~0 1) (= 0 .cse2) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|)))) [2020-07-10 15:26:09,448 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~a~0.base, main_~a~0.offset]. (and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|)) [2020-07-10 15:26:09,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:09,558 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-10 15:26:09,561 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:09,568 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:09,570 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:09,571 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:7 [2020-07-10 15:26:09,573 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:09,574 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#sum~0.base|, |main_~#sum~0.offset|, main_~a~0.base, main_~a~0.offset]. (let ((.cse0 (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= .cse0 2) (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= .cse0 |main_#t~mem7|) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) [2020-07-10 15:26:09,574 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 2 |main_#t~mem7|) (<= ~N~0 1)) [2020-07-10 15:26:09,636 INFO L263 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {488#true} is VALID [2020-07-10 15:26:09,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {488#true} is VALID [2020-07-10 15:26:09,636 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-10 15:26:09,637 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #100#return; {488#true} is VALID [2020-07-10 15:26:09,637 INFO L263 TraceCheckUtils]: 4: Hoare triple {488#true} call #t~ret12 := main(); {488#true} is VALID [2020-07-10 15:26:09,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {488#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {488#true} is VALID [2020-07-10 15:26:09,637 INFO L280 TraceCheckUtils]: 6: Hoare triple {488#true} assume !(~N~0 <= 0); {488#true} is VALID [2020-07-10 15:26:09,638 INFO L263 TraceCheckUtils]: 7: Hoare triple {488#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {488#true} is VALID [2020-07-10 15:26:09,638 INFO L280 TraceCheckUtils]: 8: Hoare triple {488#true} ~cond := #in~cond; {488#true} is VALID [2020-07-10 15:26:09,638 INFO L280 TraceCheckUtils]: 9: Hoare triple {488#true} assume !(0 == ~cond); {488#true} is VALID [2020-07-10 15:26:09,639 INFO L280 TraceCheckUtils]: 10: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-10 15:26:09,639 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {488#true} {488#true} #96#return; {488#true} is VALID [2020-07-10 15:26:09,641 INFO L280 TraceCheckUtils]: 12: Hoare triple {488#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(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {544#(and (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:09,642 INFO L280 TraceCheckUtils]: 13: Hoare triple {544#(and (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ 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); {548#(and (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:09,644 INFO L280 TraceCheckUtils]: 14: Hoare triple {548#(and (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {552#(and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:09,645 INFO L280 TraceCheckUtils]: 15: Hoare triple {552#(and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !(~i~0 < ~N~0); {556#(and (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:09,647 INFO L280 TraceCheckUtils]: 16: Hoare triple {556#(and (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} ~i~0 := 0; {560#(and (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-10 15:26:09,649 INFO L280 TraceCheckUtils]: 17: Hoare triple {560#(and (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem4; {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} is VALID [2020-07-10 15:26:09,650 INFO L280 TraceCheckUtils]: 18: Hoare triple {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} is VALID [2020-07-10 15:26:09,652 INFO L280 TraceCheckUtils]: 19: Hoare triple {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} assume !(~i~0 < ~N~0); {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} is VALID [2020-07-10 15:26:09,653 INFO L280 TraceCheckUtils]: 20: Hoare triple {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} ~i~0 := 0; {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} is VALID [2020-07-10 15:26:09,654 INFO L280 TraceCheckUtils]: 21: Hoare triple {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {577#(and (<= 2 |main_#t~mem7|) (<= ~N~0 1))} is VALID [2020-07-10 15:26:09,655 INFO L280 TraceCheckUtils]: 22: Hoare triple {577#(and (<= 2 |main_#t~mem7|) (<= ~N~0 1))} assume #t~mem7 == ~N~0;havoc #t~mem7;call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8 - 1, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {489#false} is VALID [2020-07-10 15:26:09,656 INFO L280 TraceCheckUtils]: 23: Hoare triple {489#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {489#false} is VALID [2020-07-10 15:26:09,656 INFO L280 TraceCheckUtils]: 24: Hoare triple {489#false} assume !(~i~0 < ~N~0); {489#false} is VALID [2020-07-10 15:26:09,656 INFO L280 TraceCheckUtils]: 25: Hoare triple {489#false} ~i~0 := 0; {489#false} is VALID [2020-07-10 15:26:09,657 INFO L280 TraceCheckUtils]: 26: Hoare triple {489#false} assume !!(~i~0 < ~N~0);call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {489#false} is VALID [2020-07-10 15:26:09,657 INFO L263 TraceCheckUtils]: 27: Hoare triple {489#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {489#false} is VALID [2020-07-10 15:26:09,657 INFO L280 TraceCheckUtils]: 28: Hoare triple {489#false} ~cond := #in~cond; {489#false} is VALID [2020-07-10 15:26:09,657 INFO L280 TraceCheckUtils]: 29: Hoare triple {489#false} assume 0 == ~cond; {489#false} is VALID [2020-07-10 15:26:09,658 INFO L280 TraceCheckUtils]: 30: Hoare triple {489#false} assume !false; {489#false} is VALID [2020-07-10 15:26:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:09,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:09,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-07-10 15:26:09,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587042444] [2020-07-10 15:26:09,664 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-07-10 15:26:09,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:09,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-10 15:26:09,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:09,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-10 15:26:09,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:09,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-10 15:26:09,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:26:09,741 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 17 states. [2020-07-10 15:26:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,415 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2020-07-10 15:26:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:26:11,415 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-07-10 15:26:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:26:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2020-07-10 15:26:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:26:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2020-07-10 15:26:11,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 82 transitions. [2020-07-10 15:26:11,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:11,560 INFO L225 Difference]: With dead ends: 71 [2020-07-10 15:26:11,560 INFO L226 Difference]: Without dead ends: 57 [2020-07-10 15:26:11,561 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2020-07-10 15:26:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-10 15:26:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2020-07-10 15:26:11,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:11,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 48 states. [2020-07-10 15:26:11,605 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 48 states. [2020-07-10 15:26:11,606 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 48 states. [2020-07-10 15:26:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,609 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2020-07-10 15:26:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2020-07-10 15:26:11,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:11,611 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 57 states. [2020-07-10 15:26:11,611 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 57 states. [2020-07-10 15:26:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,616 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2020-07-10 15:26:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2020-07-10 15:26:11,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:11,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:11,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 15:26:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2020-07-10 15:26:11,620 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 31 [2020-07-10 15:26:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:11,621 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2020-07-10 15:26:11,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-10 15:26:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-10 15:26:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:26:11,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:11,622 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, 1, 1, 1, 1, 1] [2020-07-10 15:26:11,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:26:11,837 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash -728823226, now seen corresponding path program 1 times [2020-07-10 15:26:11,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:11,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019732031] [2020-07-10 15:26:11,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:11,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:11,917 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:11,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:26:11,962 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:11,962 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:11,962 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:11,962 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:11,963 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:11,963 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:11,963 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:11,963 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:11,963 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:11,963 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:11,963 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:11,964 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:11,964 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:11,964 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:11,964 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:11,964 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:11,964 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:11,972 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:11,973 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:11,973 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:11,973 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:11,973 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:11,973 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:11,973 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:11,973 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:11,973 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:11,974 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:11,974 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:11,974 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:11,974 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:11,974 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:11,974 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-10 15:26:11,974 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:26:11,974 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:26:11,974 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-10 15:26:11,975 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:11,975 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:11,975 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:11,975 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-10 15:26:11,975 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-10 15:26:11,975 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-10 15:26:11,975 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:26:11,975 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:26:11,975 WARN L170 areAnnotationChecker]: L49-4 has no Hoare annotation [2020-07-10 15:26:11,976 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:26:11,976 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:26:11,976 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:26:11,976 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:26:11,976 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:26:11,976 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-10 15:26:11,976 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:26:11,976 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:26:11,976 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-10 15:26:11,977 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:11,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:11 BoogieIcfgContainer [2020-07-10 15:26:11,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:11,982 INFO L168 Benchmark]: Toolchain (without parser) took 6188.83 ms. Allocated memory was 144.2 MB in the beginning and 289.4 MB in the end (delta: 145.2 MB). Free memory was 100.3 MB in the beginning and 261.7 MB in the end (delta: -161.4 MB). Peak memory consumption was 153.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,983 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.45 ms. Allocated memory is still 144.2 MB. Free memory was 100.1 MB in the beginning and 88.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,985 INFO L168 Benchmark]: Boogie Preprocessor took 129.06 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 88.8 MB in the beginning and 178.0 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,986 INFO L168 Benchmark]: RCFGBuilder took 486.29 ms. Allocated memory is still 200.8 MB. Free memory was 178.0 MB in the beginning and 151.5 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,986 INFO L168 Benchmark]: TraceAbstraction took 5284.38 ms. Allocated memory was 200.8 MB in the beginning and 289.4 MB in the end (delta: 88.6 MB). Free memory was 150.8 MB in the beginning and 261.7 MB in the end (delta: -110.9 MB). Peak memory consumption was 147.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:11,990 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.25 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 283.45 ms. Allocated memory is still 144.2 MB. Free memory was 100.1 MB in the beginning and 88.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.06 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 88.8 MB in the beginning and 178.0 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 486.29 ms. Allocated memory is still 200.8 MB. Free memory was 178.0 MB in the beginning and 151.5 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5284.38 ms. Allocated memory was 200.8 MB in the beginning and 289.4 MB in the end (delta: 88.6 MB). Free memory was 150.8 MB in the beginning and 261.7 MB in the end (delta: -110.9 MB). Peak memory consumption was 147.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 0 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={5:0}] [L30] COND TRUE i