/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-46f3038-m [2020-07-08 12:44:25,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:44:25,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:44:25,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:44:25,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:44:25,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:44:25,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:44:25,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:44:25,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:44:25,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:44:25,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:44:25,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:44:25,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:44:25,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:44:25,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:44:25,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:44:25,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:44:25,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:44:25,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:44:25,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:44:25,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:44:25,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:44:25,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:44:25,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:44:25,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:44:25,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:44:25,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:44:25,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:44:25,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:44:25,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:44:25,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:44:25,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:44:25,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:44:25,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:44:25,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:44:25,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:44:25,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:44:25,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:44:25,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:44:25,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:44:25,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:44:25,109 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-08 12:44:25,142 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:44:25,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:44:25,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:44:25,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:44:25,147 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:44:25,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:44:25,150 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:44:25,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:44:25,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:44:25,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:44:25,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:44:25,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:44:25,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:44:25,152 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:44:25,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:44:25,152 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:44:25,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:44:25,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:44:25,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:44:25,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:44:25,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:44:25,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:44:25,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:44:25,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:44:25,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:44:25,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:44:25,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:44:25,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:44:25,157 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:44:25,157 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:44:25,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:44:25,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:44:25,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:44:25,438 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:44:25,438 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:44:25,439 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-08 12:44:25,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e639ce9/733cad88990f4d4e8bb592d9eec0faf9/FLAGf6c23ea9e [2020-07-08 12:44:25,941 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:44:25,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condnf.c [2020-07-08 12:44:25,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e639ce9/733cad88990f4d4e8bb592d9eec0faf9/FLAGf6c23ea9e [2020-07-08 12:44:26,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e639ce9/733cad88990f4d4e8bb592d9eec0faf9 [2020-07-08 12:44:26,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:44:26,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:44:26,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:26,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:44:26,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:44:26,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:26" (1/1) ... [2020-07-08 12:44:26,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5b7a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26, skipping insertion in model container [2020-07-08 12:44:26,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:26" (1/1) ... [2020-07-08 12:44:26,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:44:26,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:44:26,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:26,568 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:44:26,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:26,606 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:44:26,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26 WrapperNode [2020-07-08 12:44:26,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:26,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:44:26,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:44:26,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:44:26,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26" (1/1) ... [2020-07-08 12:44:26,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26" (1/1) ... [2020-07-08 12:44:26,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26" (1/1) ... [2020-07-08 12:44:26,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26" (1/1) ... [2020-07-08 12:44:26,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26" (1/1) ... [2020-07-08 12:44:26,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26" (1/1) ... [2020-07-08 12:44:26,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26" (1/1) ... [2020-07-08 12:44:26,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:44:26,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:44:26,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:44:26,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:44:26,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26" (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-08 12:44:26,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:44:26,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:44:26,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:44:26,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:44:26,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:44:26,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:44:26,786 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:44:26,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:44:26,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:44:26,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:44:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:44:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:44:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:44:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:44:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:44:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:44:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:44:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:44:27,182 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:44:27,182 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 12:44:27,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:27 BoogieIcfgContainer [2020-07-08 12:44:27,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:44:27,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:44:27,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:44:27,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:44:27,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:44:26" (1/3) ... [2020-07-08 12:44:27,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be307b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:27, skipping insertion in model container [2020-07-08 12:44:27,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:26" (2/3) ... [2020-07-08 12:44:27,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be307b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:27, skipping insertion in model container [2020-07-08 12:44:27,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:27" (3/3) ... [2020-07-08 12:44:27,194 INFO L109 eAbstractionObserver]: Analyzing ICFG condnf.c [2020-07-08 12:44:27,204 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:44:27,211 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:44:27,223 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:44:27,243 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:44:27,243 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:44:27,243 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:44:27,243 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:44:27,243 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:44:27,244 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:44:27,244 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:44:27,244 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:44:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-08 12:44:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:44:27,265 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:27,265 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-08 12:44:27,266 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:27,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:27,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1524373234, now seen corresponding path program 1 times [2020-07-08 12:44:27,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:27,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364935956] [2020-07-08 12:44:27,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:27,491 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-08 12:44:27,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-08 12:44:27,493 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-08 12:44:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:27,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-08 12:44:27,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-08 12:44:27,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-08 12:44:27,505 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-08 12:44:27,507 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-08 12:44:27,507 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-08 12:44:27,508 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-08 12:44:27,509 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-08 12:44:27,509 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret9 := main(); {38#true} is VALID [2020-07-08 12:44:27,510 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-08 12:44:27,510 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~N~0 <= 0); {38#true} is VALID [2020-07-08 12:44:27,511 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-08 12:44:27,511 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-08 12:44:27,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-08 12:44:27,512 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-08 12:44:27,513 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-08 12:44:27,513 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-08 12:44:27,514 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-08 12:44:27,514 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-08 12:44:27,515 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-08 12:44:27,515 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-08 12:44:27,516 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-08 12:44:27,516 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-08 12:44:27,517 INFO L280 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-08 12:44:27,517 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-08 12:44:27,517 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-08 12:44:27,520 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-08 12:44:27,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364935956] [2020-07-08 12:44:27,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:27,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:44:27,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363179466] [2020-07-08 12:44:27,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:44:27,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:27,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:44:27,581 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-08 12:44:27,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:44:27,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:27,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:44:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:44:27,594 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-08 12:44:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:27,780 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2020-07-08 12:44:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:44:27,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:44:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-08 12:44:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-08 12:44:27,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-08 12:44:27,932 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-08 12:44:27,945 INFO L225 Difference]: With dead ends: 60 [2020-07-08 12:44:27,945 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:44:27,949 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-08 12:44:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:44:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-08 12:44:27,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:28,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-08 12:44:28,000 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:44:28,000 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:44:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,005 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:44:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:44:28,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:28,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:28,006 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:44:28,006 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:44:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,011 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:44:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:44:28,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:28,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:28,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:28,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 12:44:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-08 12:44:28,017 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2020-07-08 12:44:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:28,017 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-08 12:44:28,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:44:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:44:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:44:28,018 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:28,019 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-08 12:44:28,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:44:28,019 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:28,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2111179248, now seen corresponding path program 1 times [2020-07-08 12:44:28,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:28,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473181421] [2020-07-08 12:44:28,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:28,143 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-08 12:44:28,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-08 12:44:28,144 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #86#return; {227#true} is VALID [2020-07-08 12:44:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:28,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-08 12:44:28,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-08 12:44:28,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-08 12:44:28,156 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #82#return; {232#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:28,157 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-08 12:44:28,157 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-08 12:44:28,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-08 12:44:28,158 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #86#return; {227#true} is VALID [2020-07-08 12:44:28,158 INFO L263 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret9 := main(); {227#true} is VALID [2020-07-08 12:44:28,159 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-08 12:44:28,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(~N~0 <= 0); {232#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:28,161 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-08 12:44:28,162 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-08 12:44:28,162 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-08 12:44:28,162 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-08 12:44:28,163 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #82#return; {232#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:28,165 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-08 12:44:28,166 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-08 12:44:28,167 INFO L280 TraceCheckUtils]: 14: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-08 12:44:28,167 INFO L280 TraceCheckUtils]: 15: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-08 12:44:28,167 INFO L280 TraceCheckUtils]: 16: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-08 12:44:28,168 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-08 12:44:28,168 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-08 12:44:28,168 INFO L280 TraceCheckUtils]: 19: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2020-07-08 12:44:28,169 INFO L280 TraceCheckUtils]: 20: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2020-07-08 12:44:28,169 INFO L280 TraceCheckUtils]: 21: Hoare triple {228#false} assume !false; {228#false} is VALID [2020-07-08 12:44:28,170 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-08 12:44:28,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473181421] [2020-07-08 12:44:28,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:28,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:44:28,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613835870] [2020-07-08 12:44:28,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-08 12:44:28,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:28,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:44:28,204 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-08 12:44:28,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:44:28,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:28,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:44:28,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:44:28,206 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2020-07-08 12:44:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,491 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-07-08 12:44:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:44:28,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-08 12:44:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-08 12:44:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-08 12:44:28,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-08 12:44:28,611 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-08 12:44:28,614 INFO L225 Difference]: With dead ends: 54 [2020-07-08 12:44:28,614 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 12:44:28,616 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-08 12:44:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 12:44:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-07-08 12:44:28,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:28,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2020-07-08 12:44:28,650 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2020-07-08 12:44:28,650 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2020-07-08 12:44:28,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,655 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-08 12:44:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-08 12:44:28,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:28,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:28,657 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2020-07-08 12:44:28,657 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2020-07-08 12:44:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:28,661 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-08 12:44:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-08 12:44:28,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:28,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:28,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:28,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:44:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-08 12:44:28,666 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2020-07-08 12:44:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:28,666 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-08 12:44:28,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:44:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-08 12:44:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:44:28,668 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:28,668 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-08 12:44:28,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:44:28,668 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash 373909448, now seen corresponding path program 1 times [2020-07-08 12:44:28,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:28,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949064172] [2020-07-08 12:44:28,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:44:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:44:28,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:44:28,777 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:44:28,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:44:28,811 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:44:28,811 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:28,812 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:28,812 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:44:28,812 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:44:28,812 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:44:28,812 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:44:28,813 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:28,813 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:28,813 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:44:28,813 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:44:28,813 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:44:28,813 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:44:28,814 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:44:28,814 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:44:28,814 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:44:28,814 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:44:28,814 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-08 12:44:28,814 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:44:28,815 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:44:28,815 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:44:28,815 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:44:28,815 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:44:28,815 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:44:28,816 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 12:44:28,816 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:44:28,816 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:44:28,816 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:44:28,816 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-08 12:44:28,817 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-08 12:44:28,817 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-08 12:44:28,817 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-08 12:44:28,817 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-08 12:44:28,817 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-08 12:44:28,818 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-08 12:44:28,818 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-08 12:44:28,818 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-08 12:44:28,818 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-08 12:44:28,819 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 12:44:28,819 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 12:44:28,819 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 12:44:28,819 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-08 12:44:28,820 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:44:28,820 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:44:28,820 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-08 12:44:28,820 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 12:44:28,821 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 12:44:28,821 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-08 12:44:28,821 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-08 12:44:28,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:44:28 BoogieIcfgContainer [2020-07-08 12:44:28,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:44:28,828 INFO L168 Benchmark]: Toolchain (without parser) took 2479.05 ms. Allocated memory was 139.5 MB in the beginning and 234.4 MB in the end (delta: 94.9 MB). Free memory was 104.2 MB in the beginning and 100.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 99.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,829 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.79 ms. Allocated memory is still 139.5 MB. Free memory was 104.0 MB in the beginning and 93.1 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,832 INFO L168 Benchmark]: Boogie Preprocessor took 112.28 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 93.1 MB in the beginning and 180.5 MB in the end (delta: -87.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,832 INFO L168 Benchmark]: RCFGBuilder took 466.01 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 155.1 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,834 INFO L168 Benchmark]: TraceAbstraction took 1637.20 ms. Allocated memory was 202.9 MB in the beginning and 234.4 MB in the end (delta: 31.5 MB). Free memory was 154.4 MB in the beginning and 100.0 MB in the end (delta: 54.4 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,837 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.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 257.79 ms. Allocated memory is still 139.5 MB. Free memory was 104.0 MB in the beginning and 93.1 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.28 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 93.1 MB in the beginning and 180.5 MB in the end (delta: -87.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 466.01 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 155.1 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1637.20 ms. Allocated memory was 202.9 MB in the beginning and 234.4 MB in the end (delta: 31.5 MB). Free memory was 154.4 MB in the beginning and 100.0 MB in the end (delta: 54.4 MB). Peak memory consumption was 85.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