/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/condnf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:48:56,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:48:56,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:48:56,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:48:56,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:48:56,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:48:56,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:48:56,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:48:56,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:48:56,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:48:56,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:48:56,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:48:56,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:48:56,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:48:56,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:48:56,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:48:56,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:48:56,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:48:56,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:48:56,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:48:56,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:48:56,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:48:56,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:48:56,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:48:56,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:48:56,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:48:56,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:48:56,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:48:56,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:48:56,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:48:56,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:48:56,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:48:56,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:48:56,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:48:56,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:48:56,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:48:56,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:48:56,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:48:56,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:48:56,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:48:56,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:48:56,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:48:56,622 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:48:56,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:48:56,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:48:56,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:48:56,628 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:48:56,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:48:56,628 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:48:56,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:48:56,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:48:56,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:48:56,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:48:56,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:48:56,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:48:56,631 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:48:56,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:48:56,632 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:48:56,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:48:56,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:48:56,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:48:56,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:48:56,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:48:56,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:48:56,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:48:56,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:48:56,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:48:56,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:48:56,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:48:56,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:48:56,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:48:56,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:48:57,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:48:57,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:48:57,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:48:57,100 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:48:57,100 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:48:57,102 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condnf.c [2020-07-17 22:48:57,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43bc1c439/001e41f466854e0f8e9ae57841310170/FLAG8084f8257 [2020-07-17 22:48:57,888 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:48:57,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condnf.c [2020-07-17 22:48:57,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43bc1c439/001e41f466854e0f8e9ae57841310170/FLAG8084f8257 [2020-07-17 22:48:58,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43bc1c439/001e41f466854e0f8e9ae57841310170 [2020-07-17 22:48:58,248 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:48:58,252 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:48:58,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:58,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:48:58,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:48:58,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7963ab65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58, skipping insertion in model container [2020-07-17 22:48:58,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:48:58,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:48:58,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:58,582 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:48:58,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:58,669 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:48:58,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58 WrapperNode [2020-07-17 22:48:58,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:58,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:48:58,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:48:58,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:48:58,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... [2020-07-17 22:48:58,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:48:58,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:48:58,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:48:58,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:48:58,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:48:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:48:58,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:48:58,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:48:58,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:48:58,954 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:48:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:48:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:48:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:48:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:48:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:48:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:48:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:48:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:48:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:48:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:48:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:48:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:48:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:48:59,585 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:48:59,586 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:48:59,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:59 BoogieIcfgContainer [2020-07-17 22:48:59,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:48:59,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:48:59,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:48:59,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:48:59,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:48:58" (1/3) ... [2020-07-17 22:48:59,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dd17fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:59, skipping insertion in model container [2020-07-17 22:48:59,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:58" (2/3) ... [2020-07-17 22:48:59,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dd17fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:59, skipping insertion in model container [2020-07-17 22:48:59,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:59" (3/3) ... [2020-07-17 22:48:59,605 INFO L109 eAbstractionObserver]: Analyzing ICFG condnf.c [2020-07-17 22:48:59,622 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:48:59,635 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:48:59,656 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:48:59,697 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:48:59,698 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:48:59,698 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:48:59,698 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:48:59,698 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:48:59,699 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:48:59,699 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:48:59,699 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:48:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-17 22:48:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:48:59,733 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:59,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:48:59,736 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1524373234, now seen corresponding path program 1 times [2020-07-17 22:48:59,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:59,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374341029] [2020-07-17 22:48:59,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:00,049 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#(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; {38#true} is VALID [2020-07-17 22:49:00,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:49:00,052 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-17 22:49:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:00,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-17 22:49:00,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-17 22:49:00,071 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-17 22:49:00,072 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-17 22:49:00,075 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:00,076 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(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; {38#true} is VALID [2020-07-17 22:49:00,077 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:49:00,077 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-17 22:49:00,078 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret9 := main(); {38#true} is VALID [2020-07-17 22:49:00,079 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {38#true} is VALID [2020-07-17 22:49:00,079 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~N~0 <= 0); {38#true} is VALID [2020-07-17 22:49:00,080 INFO L263 TraceCheckUtils]: 7: Hoare triple {38#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {38#true} is VALID [2020-07-17 22:49:00,080 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-17 22:49:00,081 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-17 22:49:00,082 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-17 22:49:00,082 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-17 22:49:00,083 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {39#false} is VALID [2020-07-17 22:49:00,084 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-17 22:49:00,084 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-17 22:49:00,085 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-17 22:49:00,085 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-17 22:49:00,088 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} assume !!(~i~0 < ~N~0);call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {39#false} is VALID [2020-07-17 22:49:00,089 INFO L263 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if #t~mem8 <= ~N~0 then 1 else 0)); {39#false} is VALID [2020-07-17 22:49:00,090 INFO L280 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-17 22:49:00,091 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-17 22:49:00,091 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-17 22:49:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:00,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374341029] [2020-07-17 22:49:00,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:00,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:00,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970541509] [2020-07-17 22:49:00,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:00,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:00,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:00,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:00,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:00,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:00,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:00,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:00,251 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-17 22:49:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:00,637 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2020-07-17 22:49:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:00,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-17 22:49:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-17 22:49:00,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-17 22:49:00,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:00,906 INFO L225 Difference]: With dead ends: 60 [2020-07-17 22:49:00,906 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:49:00,919 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:49:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 22:49:01,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:01,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-17 22:49:01,014 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:49:01,015 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:49:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:01,020 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:49:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:49:01,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:01,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:01,023 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:49:01,023 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:49:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:01,029 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:49:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:49:01,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:01,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:01,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:01,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:49:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-17 22:49:01,036 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2020-07-17 22:49:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:01,037 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-17 22:49:01,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:49:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:01,039 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:01,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:01,040 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:01,043 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:01,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2111179248, now seen corresponding path program 1 times [2020-07-17 22:49:01,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:01,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826030822] [2020-07-17 22:49:01,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:01,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#(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; {227#true} is VALID [2020-07-17 22:49:01,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:49:01,213 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #86#return; {227#true} is VALID [2020-07-17 22:49:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:01,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-17 22:49:01,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-17 22:49:01,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:49:01,229 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #82#return; {232#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:01,232 INFO L263 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {238#(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:01,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {238#(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; {227#true} is VALID [2020-07-17 22:49:01,233 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:49:01,234 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #86#return; {227#true} is VALID [2020-07-17 22:49:01,234 INFO L263 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret9 := main(); {227#true} is VALID [2020-07-17 22:49:01,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {227#true} is VALID [2020-07-17 22:49:01,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(~N~0 <= 0); {232#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:01,237 INFO L263 TraceCheckUtils]: 7: Hoare triple {232#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {227#true} is VALID [2020-07-17 22:49:01,238 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-17 22:49:01,238 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-17 22:49:01,239 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:49:01,240 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #82#return; {232#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:01,242 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#(<= 1 ~N~0)} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:01,246 INFO L280 TraceCheckUtils]: 13: Hoare triple {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-17 22:49:01,247 INFO L280 TraceCheckUtils]: 14: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-17 22:49:01,248 INFO L280 TraceCheckUtils]: 15: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-17 22:49:01,249 INFO L280 TraceCheckUtils]: 16: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-17 22:49:01,249 INFO L280 TraceCheckUtils]: 17: Hoare triple {228#false} assume !!(~i~0 < ~N~0);call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {228#false} is VALID [2020-07-17 22:49:01,249 INFO L263 TraceCheckUtils]: 18: Hoare triple {228#false} call __VERIFIER_assert((if #t~mem8 <= ~N~0 then 1 else 0)); {228#false} is VALID [2020-07-17 22:49:01,249 INFO L280 TraceCheckUtils]: 19: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2020-07-17 22:49:01,250 INFO L280 TraceCheckUtils]: 20: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2020-07-17 22:49:01,250 INFO L280 TraceCheckUtils]: 21: Hoare triple {228#false} assume !false; {228#false} is VALID [2020-07-17 22:49:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:01,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826030822] [2020-07-17 22:49:01,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:01,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:01,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806516814] [2020-07-17 22:49:01,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-17 22:49:01,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:01,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:01,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:01,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:01,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:01,298 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2020-07-17 22:49:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:01,791 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-07-17 22:49:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:01,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-17 22:49:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-17 22:49:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-17 22:49:01,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-17 22:49:01,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:01,963 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:49:01,964 INFO L226 Difference]: Without dead ends: 39 [2020-07-17 22:49:01,968 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:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-17 22:49:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-07-17 22:49:02,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:02,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2020-07-17 22:49:02,051 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2020-07-17 22:49:02,051 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2020-07-17 22:49:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:02,066 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-17 22:49:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-17 22:49:02,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:02,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:02,071 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2020-07-17 22:49:02,071 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2020-07-17 22:49:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:02,082 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-17 22:49:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-17 22:49:02,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:02,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:02,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:02,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:02,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:49:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-17 22:49:02,095 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2020-07-17 22:49:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:02,096 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-17 22:49:02,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-17 22:49:02,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:49:02,099 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:02,100 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] [2020-07-17 22:49:02,100 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:49:02,101 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash 373909448, now seen corresponding path program 1 times [2020-07-17 22:49:02,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:02,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736103253] [2020-07-17 22:49:02,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:02,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:02,314 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:02,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:49:02,361 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:02,362 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:02,362 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:02,362 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:02,362 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:02,362 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-17 22:49:02,369 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-17 22:49:02,369 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-17 22:49:02,369 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-17 22:49:02,369 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-17 22:49:02,369 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:49:02,370 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:49:02,370 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-17 22:49:02,370 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:49:02,370 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:49:02,370 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-17 22:49:02,371 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:02,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:02 BoogieIcfgContainer [2020-07-17 22:49:02,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:02,379 INFO L168 Benchmark]: Toolchain (without parser) took 4127.74 ms. Allocated memory was 137.4 MB in the beginning and 233.3 MB in the end (delta: 95.9 MB). Free memory was 102.0 MB in the beginning and 104.8 MB in the end (delta: -2.8 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,381 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.12 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 90.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,383 INFO L168 Benchmark]: Boogie Preprocessor took 195.30 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 90.8 MB in the beginning and 179.9 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,384 INFO L168 Benchmark]: RCFGBuilder took 725.52 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 154.5 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,385 INFO L168 Benchmark]: TraceAbstraction took 2779.94 ms. Allocated memory was 202.4 MB in the beginning and 233.3 MB in the end (delta: 30.9 MB). Free memory was 153.8 MB in the beginning and 104.8 MB in the end (delta: 49.0 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,390 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.61 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 414.12 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 90.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 195.30 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 90.8 MB in the beginning and 179.9 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 725.52 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 154.5 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2779.94 ms. Allocated memory was 202.4 MB in the beginning and 233.3 MB in the end (delta: 30.9 MB). Free memory was 153.8 MB in the beginning and 104.8 MB in the end (delta: 49.0 MB). Peak memory consumption was 79.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=6, 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] int *a = malloc(sizeof(int)*N); [L28] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L28] COND TRUE i N [L36] EXPR a[i] [L36] a[i] = a[i] [L33] i++ VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1] [L33] COND FALSE !(i