/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/sina1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:54,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:54,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:54,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:54,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:54,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:54,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:54,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:54,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:54,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:54,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:54,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:54,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:54,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:54,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:54,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:54,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:54,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:54,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:54,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:54,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:54,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:54,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:54,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:54,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:54,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:54,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:54,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:54,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:54,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:54,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:54,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:54,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:54,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:54,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:54,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:54,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:54,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:54,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:54,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:54,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:54,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:49:54,463 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:54,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:54,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:54,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:54,465 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:54,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:54,465 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:54,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:54,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:54,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:54,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:54,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:54,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:54,467 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:54,467 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:54,467 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:54,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:54,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:54,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:54,468 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:54,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:54,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:54,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:54,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:54,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:54,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:54,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:54,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:54,470 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:54,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:54,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:54,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:54,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:54,761 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:54,761 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:54,762 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina1f.c [2020-07-17 22:49:54,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763fd0be1/f43698c5c3fa4795959541e89991a759/FLAG61f9857f9 [2020-07-17 22:49:55,335 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:55,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina1f.c [2020-07-17 22:49:55,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763fd0be1/f43698c5c3fa4795959541e89991a759/FLAG61f9857f9 [2020-07-17 22:49:55,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763fd0be1/f43698c5c3fa4795959541e89991a759 [2020-07-17 22:49:55,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:55,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:55,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:55,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:55,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:55,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:55" (1/1) ... [2020-07-17 22:49:55,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@323aba55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55, skipping insertion in model container [2020-07-17 22:49:55,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:55" (1/1) ... [2020-07-17 22:49:55,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:55,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:55,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:55,931 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:55,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:55,970 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:55,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55 WrapperNode [2020-07-17 22:49:55,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:55,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:55,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:55,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:56,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55" (1/1) ... [2020-07-17 22:49:56,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55" (1/1) ... [2020-07-17 22:49:56,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55" (1/1) ... [2020-07-17 22:49:56,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55" (1/1) ... [2020-07-17 22:49:56,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55" (1/1) ... [2020-07-17 22:49:56,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55" (1/1) ... [2020-07-17 22:49:56,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55" (1/1) ... [2020-07-17 22:49:56,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:56,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:56,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:56,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:56,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:56,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:56,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:56,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:56,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:56,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:49:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:56,605 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:56,605 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:49:56,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:56 BoogieIcfgContainer [2020-07-17 22:49:56,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:56,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:56,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:56,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:56,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:55" (1/3) ... [2020-07-17 22:49:56,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135b58c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:56, skipping insertion in model container [2020-07-17 22:49:56,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:55" (2/3) ... [2020-07-17 22:49:56,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135b58c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:56, skipping insertion in model container [2020-07-17 22:49:56,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:56" (3/3) ... [2020-07-17 22:49:56,619 INFO L109 eAbstractionObserver]: Analyzing ICFG sina1f.c [2020-07-17 22:49:56,627 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:56,633 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:56,645 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:56,667 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:56,668 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:56,668 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:56,668 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:56,668 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:56,668 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:56,669 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:56,669 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-17 22:49:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:56,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:56,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:56,691 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:56,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-17 22:49:56,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:56,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390957819] [2020-07-17 22:49:56,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:56,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(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; {37#true} is VALID [2020-07-17 22:49:56,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-17 22:49:56,932 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-17 22:49:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:56,941 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-17 22:49:56,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-17 22:49:56,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-17 22:49:56,943 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-17 22:49:56,945 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:56,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(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; {37#true} is VALID [2020-07-17 22:49:56,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-17 22:49:56,947 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-17 22:49:56,947 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret8 := main(); {37#true} is VALID [2020-07-17 22:49:56,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {37#true} is VALID [2020-07-17 22:49:56,948 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(~N~0 <= 0); {37#true} is VALID [2020-07-17 22:49:56,948 INFO L263 TraceCheckUtils]: 7: Hoare triple {37#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {37#true} is VALID [2020-07-17 22:49:56,949 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-17 22:49:56,950 INFO L280 TraceCheckUtils]: 9: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-17 22:49:56,950 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-17 22:49:56,951 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-17 22:49:56,951 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);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, 4);~i~0 := 0; {38#false} is VALID [2020-07-17 22:49:56,952 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-17 22:49:56,952 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-17 22:49:56,953 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-17 22:49:56,953 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-17 22:49:56,954 INFO L280 TraceCheckUtils]: 17: Hoare triple {38#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {38#false} is VALID [2020-07-17 22:49:56,954 INFO L263 TraceCheckUtils]: 18: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem7 == ~N~0 then 1 else 0)); {38#false} is VALID [2020-07-17 22:49:56,954 INFO L280 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2020-07-17 22:49:56,955 INFO L280 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2020-07-17 22:49:56,955 INFO L280 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-17 22:49:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:56,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390957819] [2020-07-17 22:49:56,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:56,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:56,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517659767] [2020-07-17 22:49:56,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:56,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:56,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:57,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:57,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:57,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:57,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:57,033 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-17 22:49:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:57,269 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-17 22:49:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:57,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-17 22:49:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-17 22:49:57,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2020-07-17 22:49:57,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:57,420 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:49:57,420 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:49:57,424 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:49:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-17 22:49:57,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:57,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:57,484 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:57,484 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:57,489 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:49:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:57,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:57,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:57,491 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:57,491 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:57,496 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:49:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:57,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:57,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:57,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:57,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:49:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-17 22:49:57,515 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-17 22:49:57,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:57,516 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-17 22:49:57,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:57,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:57,517 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:57,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:57,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:57,518 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:57,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:57,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-17 22:49:57,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:57,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101186882] [2020-07-17 22:49:57,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:57,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(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; {221#true} is VALID [2020-07-17 22:49:57,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:57,666 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-17 22:49:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:57,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-17 22:49:57,679 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-17 22:49:57,679 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:57,681 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #77#return; {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:57,682 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:57,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#(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; {221#true} is VALID [2020-07-17 22:49:57,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:57,683 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-17 22:49:57,683 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret8 := main(); {221#true} is VALID [2020-07-17 22:49:57,683 INFO L280 TraceCheckUtils]: 5: Hoare triple {221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {221#true} is VALID [2020-07-17 22:49:57,684 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:57,685 INFO L263 TraceCheckUtils]: 7: Hoare triple {226#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {221#true} is VALID [2020-07-17 22:49:57,685 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-17 22:49:57,685 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-17 22:49:57,686 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:57,687 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #77#return; {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:57,688 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);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, 4);~i~0 := 0; {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:57,689 INFO L280 TraceCheckUtils]: 13: Hoare triple {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-17 22:49:57,689 INFO L280 TraceCheckUtils]: 14: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-17 22:49:57,690 INFO L280 TraceCheckUtils]: 15: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-17 22:49:57,690 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-17 22:49:57,690 INFO L280 TraceCheckUtils]: 17: Hoare triple {222#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {222#false} is VALID [2020-07-17 22:49:57,690 INFO L263 TraceCheckUtils]: 18: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem7 == ~N~0 then 1 else 0)); {222#false} is VALID [2020-07-17 22:49:57,691 INFO L280 TraceCheckUtils]: 19: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2020-07-17 22:49:57,691 INFO L280 TraceCheckUtils]: 20: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2020-07-17 22:49:57,691 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-17 22:49:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:57,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101186882] [2020-07-17 22:49:57,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:57,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:57,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744022533] [2020-07-17 22:49:57,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-17 22:49:57,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:57,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:57,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:57,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:57,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:57,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:57,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:57,728 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2020-07-17 22:49:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:57,993 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-07-17 22:49:57,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:57,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-17 22:49:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-17 22:49:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-17 22:49:58,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-17 22:49:58,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:58,086 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:49:58,086 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:49:58,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:49:58,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:49:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-07-17 22:49:58,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:58,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 31 states. [2020-07-17 22:49:58,120 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 31 states. [2020-07-17 22:49:58,120 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 31 states. [2020-07-17 22:49:58,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:58,125 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 22:49:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-17 22:49:58,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:58,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:58,127 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 37 states. [2020-07-17 22:49:58,127 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 37 states. [2020-07-17 22:49:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:58,130 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 22:49:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-17 22:49:58,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:58,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:58,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:58,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:49:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-17 22:49:58,134 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2020-07-17 22:49:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:58,135 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-17 22:49:58,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-17 22:49:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:49:58,136 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:58,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:58,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:49:58,137 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:58,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:58,137 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-17 22:49:58,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:58,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075620213] [2020-07-17 22:49:58,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:58,272 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:58,273 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:58,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:49:58,346 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:58,346 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:58,347 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:58,347 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:58,347 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:58,347 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:58,347 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:58,347 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:58,348 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:58,348 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:58,348 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:58,348 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:58,348 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:58,348 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:58,348 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:58,351 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:58,351 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:58,352 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:58,352 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:58,357 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:58,357 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:58,358 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:58,358 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:58,358 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:58,358 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:58,358 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:58,358 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:58,358 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:58,359 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:58,359 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:58,359 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:58,359 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-17 22:49:58,359 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-17 22:49:58,359 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-17 22:49:58,361 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-17 22:49:58,361 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:58,361 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:58,361 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:58,361 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:58,361 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:58,361 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:58,362 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-17 22:49:58,362 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:49:58,362 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-17 22:49:58,362 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:49:58,362 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:49:58,362 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:49:58,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:58 BoogieIcfgContainer [2020-07-17 22:49:58,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:58,370 INFO L168 Benchmark]: Toolchain (without parser) took 2673.78 ms. Allocated memory was 135.3 MB in the beginning and 226.0 MB in the end (delta: 90.7 MB). Free memory was 99.6 MB in the beginning and 104.9 MB in the end (delta: -5.3 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:58,373 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:58,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.56 ms. Allocated memory is still 135.3 MB. Free memory was 99.2 MB in the beginning and 88.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:58,375 INFO L168 Benchmark]: Boogie Preprocessor took 133.00 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 88.4 MB in the beginning and 175.4 MB in the end (delta: -87.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:58,377 INFO L168 Benchmark]: RCFGBuilder took 503.90 ms. Allocated memory is still 198.2 MB. Free memory was 175.4 MB in the beginning and 150.8 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:58,379 INFO L168 Benchmark]: TraceAbstraction took 1756.72 ms. Allocated memory was 198.2 MB in the beginning and 226.0 MB in the end (delta: 27.8 MB). Free memory was 150.8 MB in the beginning and 106.4 MB in the end (delta: 44.4 MB). Peak memory consumption was 72.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:58,389 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.22 ms. Allocated memory is still 135.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.56 ms. Allocated memory is still 135.3 MB. Free memory was 99.2 MB in the beginning and 88.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.00 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 88.4 MB in the beginning and 175.4 MB in the end (delta: -87.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 503.90 ms. Allocated memory is still 198.2 MB. Free memory was 175.4 MB in the beginning and 150.8 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1756.72 ms. Allocated memory was 198.2 MB in the beginning and 226.0 MB in the end (delta: 27.8 MB). Free memory was 150.8 MB in the beginning and 106.4 MB in the end (delta: 44.4 MB). Peak memory consumption was 72.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)=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 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={3:0}] [L30] COND TRUE i