/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/s5iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:45:13,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:45:13,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:45:13,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:45:13,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:45:13,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:45:13,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:45:13,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:45:13,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:45:13,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:45:13,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:45:13,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:45:13,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:45:13,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:45:13,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:45:13,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:45:13,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:45:13,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:45:13,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:45:13,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:45:13,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:45:13,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:45:13,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:45:13,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:45:13,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:45:13,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:45:13,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:45:13,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:45:13,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:45:13,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:45:13,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:45:13,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:45:13,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:45:13,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:45:13,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:45:13,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:45:13,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:45:13,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:45:13,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:45:13,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:45:13,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:45:13,476 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:45:13,490 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:45:13,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:45:13,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:45:13,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:45:13,492 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:45:13,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:45:13,493 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:45:13,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:45:13,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:45:13,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:45:13,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:45:13,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:45:13,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:45:13,494 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:45:13,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:45:13,494 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:45:13,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:45:13,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:45:13,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:45:13,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:45:13,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:45:13,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:13,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:45:13,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:45:13,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:45:13,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:45:13,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:45:13,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:45:13,497 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:45:13,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:45:13,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:45:13,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:45:13,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:45:13,806 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:45:13,806 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:45:13,807 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s5iff.c [2020-07-08 12:45:13,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c00c0bfa/9fc6937e9f434006b230830814f80156/FLAG66093f55d [2020-07-08 12:45:14,370 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:45:14,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s5iff.c [2020-07-08 12:45:14,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c00c0bfa/9fc6937e9f434006b230830814f80156/FLAG66093f55d [2020-07-08 12:45:14,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c00c0bfa/9fc6937e9f434006b230830814f80156 [2020-07-08 12:45:14,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:45:14,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:45:14,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:14,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:45:14,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:45:14,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:14" (1/1) ... [2020-07-08 12:45:14,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777814bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:14, skipping insertion in model container [2020-07-08 12:45:14,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:14" (1/1) ... [2020-07-08 12:45:14,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:45:14,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:45:14,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:15,007 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:45:15,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:15,079 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:45:15,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:15 WrapperNode [2020-07-08 12:45:15,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:15,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:45:15,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:45:15,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:45:15,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:15" (1/1) ... [2020-07-08 12:45:15,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:15" (1/1) ... [2020-07-08 12:45:15,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:15" (1/1) ... [2020-07-08 12:45:15,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:15" (1/1) ... [2020-07-08 12:45:15,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:15" (1/1) ... [2020-07-08 12:45:15,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:15" (1/1) ... [2020-07-08 12:45:15,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:15" (1/1) ... [2020-07-08 12:45:15,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:45:15,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:45:15,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:45:15,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:45:15,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:15" (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:45:15,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:45:15,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:45:15,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:45:15,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:45:15,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:45:15,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:45:15,300 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:45:15,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:45:15,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:45:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:45:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:45:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:45:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:45:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:45:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:45:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:45:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:45:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:45:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:45:15,706 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:45:15,707 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 12:45:15,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:15 BoogieIcfgContainer [2020-07-08 12:45:15,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:45:15,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:45:15,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:45:15,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:45:15,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:45:14" (1/3) ... [2020-07-08 12:45:15,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7a9c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:15, skipping insertion in model container [2020-07-08 12:45:15,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:15" (2/3) ... [2020-07-08 12:45:15,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7a9c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:15, skipping insertion in model container [2020-07-08 12:45:15,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:15" (3/3) ... [2020-07-08 12:45:15,721 INFO L109 eAbstractionObserver]: Analyzing ICFG s5iff.c [2020-07-08 12:45:15,732 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:45:15,745 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:45:15,775 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:45:15,808 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:45:15,809 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:45:15,809 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:45:15,809 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:45:15,809 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:45:15,809 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:45:15,809 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:45:15,809 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:45:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-08 12:45:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:45:15,835 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:15,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:15,837 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -432131487, now seen corresponding path program 1 times [2020-07-08 12:45:15,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:15,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480643570] [2020-07-08 12:45:15,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:16,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {35#true} is VALID [2020-07-08 12:45:16,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-08 12:45:16,144 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-08 12:45:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:16,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-08 12:45:16,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-08 12:45:16,178 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-08 12:45:16,179 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-08 12:45:16,181 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:16,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {35#true} is VALID [2020-07-08 12:45:16,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-08 12:45:16,182 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-08 12:45:16,183 INFO L263 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret10 := main(); {35#true} is VALID [2020-07-08 12:45:16,183 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {35#true} is VALID [2020-07-08 12:45:16,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~N~0 <= 0); {35#true} is VALID [2020-07-08 12:45:16,184 INFO L263 TraceCheckUtils]: 7: Hoare triple {35#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {35#true} is VALID [2020-07-08 12:45:16,185 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-08 12:45:16,187 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-08 12:45:16,187 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-08 12:45:16,189 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-08 12:45:16,189 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {36#false} is VALID [2020-07-08 12:45:16,190 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-08 12:45:16,191 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2020-07-08 12:45:16,192 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-08 12:45:16,193 INFO L280 TraceCheckUtils]: 16: Hoare triple {36#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {36#false} is VALID [2020-07-08 12:45:16,193 INFO L263 TraceCheckUtils]: 17: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {36#false} is VALID [2020-07-08 12:45:16,193 INFO L280 TraceCheckUtils]: 18: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2020-07-08 12:45:16,194 INFO L280 TraceCheckUtils]: 19: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2020-07-08 12:45:16,194 INFO L280 TraceCheckUtils]: 20: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-08 12:45:16,198 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:45:16,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480643570] [2020-07-08 12:45:16,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:16,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:45:16,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43592725] [2020-07-08 12:45:16,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:45:16,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:16,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:45:16,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:16,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:45:16,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:16,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:45:16,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:16,297 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-08 12:45:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:16,502 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2020-07-08 12:45:16,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:45:16,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:45:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-08 12:45:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-08 12:45:16,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2020-07-08 12:45:16,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:16,663 INFO L225 Difference]: With dead ends: 54 [2020-07-08 12:45:16,663 INFO L226 Difference]: Without dead ends: 25 [2020-07-08 12:45:16,668 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:45:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-08 12:45:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-08 12:45:16,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:16,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:16,745 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:16,745 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:16,749 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-08 12:45:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:45:16,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:16,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:16,751 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:16,751 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:16,755 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-08 12:45:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:45:16,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:16,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:16,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:16,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:45:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-08 12:45:16,761 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2020-07-08 12:45:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:16,762 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-08 12:45:16,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:45:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:45:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:45:16,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:16,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:16,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:45:16,764 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash -173966049, now seen corresponding path program 1 times [2020-07-08 12:45:16,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:16,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636957642] [2020-07-08 12:45:16,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:16,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {200#true} is VALID [2020-07-08 12:45:16,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-08 12:45:16,921 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-08 12:45:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:16,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-08 12:45:16,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-08 12:45:16,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-08 12:45:16,934 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:16,935 INFO L263 TraceCheckUtils]: 0: Hoare triple {200#true} call ULTIMATE.init(); {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:16,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {200#true} is VALID [2020-07-08 12:45:16,936 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-08 12:45:16,937 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-08 12:45:16,937 INFO L263 TraceCheckUtils]: 4: Hoare triple {200#true} call #t~ret10 := main(); {200#true} is VALID [2020-07-08 12:45:16,937 INFO L280 TraceCheckUtils]: 5: Hoare triple {200#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {200#true} is VALID [2020-07-08 12:45:16,938 INFO L280 TraceCheckUtils]: 6: Hoare triple {200#true} assume !(~N~0 <= 0); {205#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:16,939 INFO L263 TraceCheckUtils]: 7: Hoare triple {205#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {200#true} is VALID [2020-07-08 12:45:16,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-08 12:45:16,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-08 12:45:16,940 INFO L280 TraceCheckUtils]: 10: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-08 12:45:16,941 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:16,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {205#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {210#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 12:45:16,944 INFO L280 TraceCheckUtils]: 13: Hoare triple {210#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-08 12:45:16,944 INFO L280 TraceCheckUtils]: 14: Hoare triple {201#false} ~i~0 := 0; {201#false} is VALID [2020-07-08 12:45:16,944 INFO L280 TraceCheckUtils]: 15: Hoare triple {201#false} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-08 12:45:16,945 INFO L280 TraceCheckUtils]: 16: Hoare triple {201#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {201#false} is VALID [2020-07-08 12:45:16,945 INFO L263 TraceCheckUtils]: 17: Hoare triple {201#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {201#false} is VALID [2020-07-08 12:45:16,945 INFO L280 TraceCheckUtils]: 18: Hoare triple {201#false} ~cond := #in~cond; {201#false} is VALID [2020-07-08 12:45:16,946 INFO L280 TraceCheckUtils]: 19: Hoare triple {201#false} assume 0 == ~cond; {201#false} is VALID [2020-07-08 12:45:16,946 INFO L280 TraceCheckUtils]: 20: Hoare triple {201#false} assume !false; {201#false} is VALID [2020-07-08 12:45:16,948 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:45:16,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636957642] [2020-07-08 12:45:16,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:16,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:45:16,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736097641] [2020-07-08 12:45:16,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-08 12:45:16,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:16,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:45:16,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:16,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:45:16,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:16,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:45:16,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:16,983 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2020-07-08 12:45:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:17,220 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-08 12:45:17,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:45:17,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-08 12:45:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-08 12:45:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-08 12:45:17,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2020-07-08 12:45:17,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:17,292 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:45:17,293 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:45:17,294 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:45:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:45:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-07-08 12:45:17,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:17,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2020-07-08 12:45:17,328 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2020-07-08 12:45:17,328 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2020-07-08 12:45:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:17,331 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:45:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:45:17,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:17,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:17,332 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2020-07-08 12:45:17,333 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2020-07-08 12:45:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:17,335 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:45:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:45:17,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:17,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:17,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:17,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:45:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-08 12:45:17,339 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2020-07-08 12:45:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:17,339 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-08 12:45:17,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:45:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-08 12:45:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:45:17,341 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:17,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:17,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:45:17,342 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash -445719797, now seen corresponding path program 1 times [2020-07-08 12:45:17,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:17,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026336433] [2020-07-08 12:45:17,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:17,454 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:45:17,454 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:45:17,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:45:17,505 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:45:17,506 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:17,506 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:17,506 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:45:17,506 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:45:17,506 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:45:17,506 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:45:17,507 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:17,507 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:17,507 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:45:17,507 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:45:17,507 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:45:17,507 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:45:17,507 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:45:17,508 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:45:17,508 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:45:17,508 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:45:17,512 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-08 12:45:17,512 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:45:17,513 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:17,513 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:17,520 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:45:17,520 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:45:17,520 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:45:17,520 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 12:45:17,520 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:45:17,520 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:45:17,520 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:45:17,521 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:17,521 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:17,521 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:17,521 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-08 12:45:17,521 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 12:45:17,521 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 12:45:17,521 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:45:17,521 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:45:17,522 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:45:17,522 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 12:45:17,522 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 12:45:17,522 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 12:45:17,523 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 12:45:17,523 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 12:45:17,523 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 12:45:17,524 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:45:17,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:45:17 BoogieIcfgContainer [2020-07-08 12:45:17,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:45:17,531 INFO L168 Benchmark]: Toolchain (without parser) took 2831.28 ms. Allocated memory was 146.3 MB in the beginning and 234.9 MB in the end (delta: 88.6 MB). Free memory was 103.7 MB in the beginning and 120.7 MB in the end (delta: -17.0 MB). Peak memory consumption was 71.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:17,533 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:45:17,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.24 ms. Allocated memory is still 146.3 MB. Free memory was 103.5 MB in the beginning and 92.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:17,536 INFO L168 Benchmark]: Boogie Preprocessor took 145.10 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 92.2 MB in the beginning and 181.2 MB in the end (delta: -88.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:17,539 INFO L168 Benchmark]: RCFGBuilder took 485.65 ms. Allocated memory is still 203.9 MB. Free memory was 181.2 MB in the beginning and 156.7 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:17,541 INFO L168 Benchmark]: TraceAbstraction took 1814.09 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 156.0 MB in the beginning and 120.7 MB in the end (delta: 35.3 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:17,555 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.48 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 380.24 ms. Allocated memory is still 146.3 MB. Free memory was 103.5 MB in the beginning and 92.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.10 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 92.2 MB in the beginning and 181.2 MB in the end (delta: -88.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 485.65 ms. Allocated memory is still 203.9 MB. Free memory was 181.2 MB in the beginning and 156.7 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1814.09 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 156.0 MB in the beginning and 120.7 MB in the end (delta: 35.3 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 1 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L30] COND TRUE i