/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/brs5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:25:59,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:25:59,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:25:59,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:25:59,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:25:59,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:25:59,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:25:59,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:25:59,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:25:59,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:25:59,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:25:59,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:25:59,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:25:59,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:25:59,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:25:59,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:25:59,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:25:59,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:25:59,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:25:59,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:25:59,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:25:59,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:25:59,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:25:59,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:25:59,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:25:59,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:25:59,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:25:59,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:25:59,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:25:59,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:25:59,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:25:59,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:25:59,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:25:59,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:25:59,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:25:59,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:25:59,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:25:59,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:25:59,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:25:59,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:25:59,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:25:59,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:25:59,592 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:25:59,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:25:59,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:25:59,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:25:59,594 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:25:59,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:25:59,594 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:25:59,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:25:59,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:25:59,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:25:59,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:25:59,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:25:59,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:25:59,598 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:25:59,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:25:59,599 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:25:59,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:25:59,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:25:59,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:25:59,600 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:25:59,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:25:59,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:59,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:25:59,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:25:59,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:25:59,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:25:59,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:25:59,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:25:59,601 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:25:59,602 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:25:59,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:25:59,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:25:59,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:25:59,929 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:25:59,930 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:25:59,930 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs5f.c [2020-07-10 15:26:00,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb9849eb/0bd91f34d27a46728b87e2fe33e753cb/FLAG60c5baf3d [2020-07-10 15:26:00,530 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:00,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs5f.c [2020-07-10 15:26:00,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb9849eb/0bd91f34d27a46728b87e2fe33e753cb/FLAG60c5baf3d [2020-07-10 15:26:00,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb9849eb/0bd91f34d27a46728b87e2fe33e753cb [2020-07-10 15:26:00,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:00,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:00,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:00,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:00,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:00,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:00" (1/1) ... [2020-07-10 15:26:00,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb8fb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:00, skipping insertion in model container [2020-07-10 15:26:00,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:00" (1/1) ... [2020-07-10 15:26:00,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:00,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:01,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:01,125 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:01,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:01,167 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:01,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:01 WrapperNode [2020-07-10 15:26:01,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:01,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:01,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:01,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:01,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:01" (1/1) ... [2020-07-10 15:26:01,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:01" (1/1) ... [2020-07-10 15:26:01,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:01" (1/1) ... [2020-07-10 15:26:01,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:01" (1/1) ... [2020-07-10 15:26:01,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:01" (1/1) ... [2020-07-10 15:26:01,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:01" (1/1) ... [2020-07-10 15:26:01,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:01" (1/1) ... [2020-07-10 15:26:01,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:01,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:01,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:01,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:01,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:01,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:01,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:01,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:01,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:01,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:01,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:01,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:01,382 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:01,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:01,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:01,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:01,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:01,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:01,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:01,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:01,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:01,824 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:01,824 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:26:01,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:01 BoogieIcfgContainer [2020-07-10 15:26:01,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:01,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:01,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:01,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:01,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:00" (1/3) ... [2020-07-10 15:26:01,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77467e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:01, skipping insertion in model container [2020-07-10 15:26:01,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:01" (2/3) ... [2020-07-10 15:26:01,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77467e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:01, skipping insertion in model container [2020-07-10 15:26:01,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:01" (3/3) ... [2020-07-10 15:26:01,837 INFO L109 eAbstractionObserver]: Analyzing ICFG brs5f.c [2020-07-10 15:26:01,848 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:01,857 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:01,872 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:01,895 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:01,896 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:01,896 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:01,896 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:01,896 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:01,897 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:01,897 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:01,897 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-10 15:26:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:26:01,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:01,922 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-10 15:26:01,922 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:01,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1824292310, now seen corresponding path program 1 times [2020-07-10 15:26:01,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:01,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375810118] [2020-07-10 15:26:01,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:02,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#(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; {36#true} is VALID [2020-07-10 15:26:02,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:26:02,176 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #77#return; {36#true} is VALID [2020-07-10 15:26:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:02,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2020-07-10 15:26:02,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2020-07-10 15:26:02,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2020-07-10 15:26:02,194 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #73#return; {37#false} is VALID [2020-07-10 15:26:02,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:02,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(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; {36#true} is VALID [2020-07-10 15:26:02,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:26:02,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #77#return; {36#true} is VALID [2020-07-10 15:26:02,198 INFO L263 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret7 := main(); {36#true} is VALID [2020-07-10 15:26:02,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {36#true} is VALID [2020-07-10 15:26:02,199 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} assume !(~N~0 <= 0); {36#true} is VALID [2020-07-10 15:26:02,199 INFO L263 TraceCheckUtils]: 7: Hoare triple {36#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {36#true} is VALID [2020-07-10 15:26:02,200 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2020-07-10 15:26:02,201 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2020-07-10 15:26:02,201 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#false} assume true; {37#false} is VALID [2020-07-10 15:26:02,202 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {37#false} {36#true} #73#return; {37#false} is VALID [2020-07-10 15:26:02,202 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#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;~i~0 := 0; {37#false} is VALID [2020-07-10 15:26:02,203 INFO L280 TraceCheckUtils]: 13: Hoare triple {37#false} assume !(~i~0 < ~N~0); {37#false} is VALID [2020-07-10 15:26:02,203 INFO L280 TraceCheckUtils]: 14: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2020-07-10 15:26:02,204 INFO L280 TraceCheckUtils]: 15: Hoare triple {37#false} assume !true; {37#false} is VALID [2020-07-10 15:26:02,204 INFO L280 TraceCheckUtils]: 16: Hoare triple {37#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {37#false} is VALID [2020-07-10 15:26:02,205 INFO L263 TraceCheckUtils]: 17: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem6 <= 5 * ~N~0 then 1 else 0)); {37#false} is VALID [2020-07-10 15:26:02,205 INFO L280 TraceCheckUtils]: 18: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2020-07-10 15:26:02,205 INFO L280 TraceCheckUtils]: 19: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2020-07-10 15:26:02,206 INFO L280 TraceCheckUtils]: 20: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-10 15:26:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:02,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375810118] [2020-07-10 15:26:02,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:02,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:02,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983241809] [2020-07-10 15:26:02,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:26:02,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:02,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:02,282 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-10 15:26:02,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:02,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:02,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:02,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:02,295 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-07-10 15:26:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:02,548 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2020-07-10 15:26:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:02,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:26:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2020-07-10 15:26:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2020-07-10 15:26:02,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2020-07-10 15:26:02,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:02,735 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:26:02,736 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 15:26:02,740 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 15:26:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-10 15:26:02,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:02,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-10 15:26:02,800 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-10 15:26:02,800 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-10 15:26:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:02,804 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-10 15:26:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:26:02,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:02,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:02,806 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-10 15:26:02,806 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-10 15:26:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:02,810 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-10 15:26:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:26:02,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:02,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:02,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:02,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-10 15:26:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-07-10 15:26:02,817 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2020-07-10 15:26:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:02,817 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-07-10 15:26:02,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:02,818 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:26:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:26:02,819 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:02,819 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-10 15:26:02,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:02,820 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:02,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1767537087, now seen corresponding path program 1 times [2020-07-10 15:26:02,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:02,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464842373] [2020-07-10 15:26:02,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,019 INFO L280 TraceCheckUtils]: 0: Hoare triple {217#(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; {206#true} is VALID [2020-07-10 15:26:03,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:26:03,020 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #77#return; {206#true} is VALID [2020-07-10 15:26:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2020-07-10 15:26:03,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2020-07-10 15:26:03,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:26:03,040 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {206#true} {211#(<= 1 ~N~0)} #73#return; {211#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:03,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {217#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:03,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#(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; {206#true} is VALID [2020-07-10 15:26:03,043 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:26:03,043 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} #77#return; {206#true} is VALID [2020-07-10 15:26:03,043 INFO L263 TraceCheckUtils]: 4: Hoare triple {206#true} call #t~ret7 := main(); {206#true} is VALID [2020-07-10 15:26:03,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {206#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {206#true} is VALID [2020-07-10 15:26:03,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {206#true} assume !(~N~0 <= 0); {211#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:03,045 INFO L263 TraceCheckUtils]: 7: Hoare triple {211#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {206#true} is VALID [2020-07-10 15:26:03,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2020-07-10 15:26:03,046 INFO L280 TraceCheckUtils]: 9: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2020-07-10 15:26:03,046 INFO L280 TraceCheckUtils]: 10: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:26:03,049 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {206#true} {211#(<= 1 ~N~0)} #73#return; {211#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:03,051 INFO L280 TraceCheckUtils]: 12: Hoare triple {211#(<= 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;~i~0 := 0; {216#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:03,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {216#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {207#false} is VALID [2020-07-10 15:26:03,052 INFO L280 TraceCheckUtils]: 14: Hoare triple {207#false} ~i~0 := 0; {207#false} is VALID [2020-07-10 15:26:03,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {207#false} assume !(~i~0 < ~N~0); {207#false} is VALID [2020-07-10 15:26:03,053 INFO L280 TraceCheckUtils]: 16: Hoare triple {207#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {207#false} is VALID [2020-07-10 15:26:03,056 INFO L263 TraceCheckUtils]: 17: Hoare triple {207#false} call __VERIFIER_assert((if #t~mem6 <= 5 * ~N~0 then 1 else 0)); {207#false} is VALID [2020-07-10 15:26:03,056 INFO L280 TraceCheckUtils]: 18: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2020-07-10 15:26:03,056 INFO L280 TraceCheckUtils]: 19: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2020-07-10 15:26:03,057 INFO L280 TraceCheckUtils]: 20: Hoare triple {207#false} assume !false; {207#false} is VALID [2020-07-10 15:26:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:03,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464842373] [2020-07-10 15:26:03,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:03,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:03,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650379559] [2020-07-10 15:26:03,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:26:03,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:03,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:03,092 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-10 15:26:03,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:03,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:03,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:03,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:03,093 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2020-07-10 15:26:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,346 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-07-10 15:26:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:03,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:26:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 15:26:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 15:26:03,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-10 15:26:03,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:03,427 INFO L225 Difference]: With dead ends: 45 [2020-07-10 15:26:03,428 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 15:26:03,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:26:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 15:26:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-10 15:26:03,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:03,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-10 15:26:03,452 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-10 15:26:03,452 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-10 15:26:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,455 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-10 15:26:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:26:03,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,457 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-10 15:26:03,457 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-10 15:26:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,460 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-10 15:26:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:26:03,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:03,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:26:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-10 15:26:03,464 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2020-07-10 15:26:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:03,465 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-10 15:26:03,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:26:03,466 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:03,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:03,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:03,467 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:03,467 INFO L82 PathProgramCache]: Analyzing trace with hash -395878216, now seen corresponding path program 1 times [2020-07-10 15:26:03,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:03,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130331818] [2020-07-10 15:26:03,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:03,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:03,562 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:03,562 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:26:03,607 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:03,607 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:03,607 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:03,607 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:03,607 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:03,608 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:03,608 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:03,608 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:03,608 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:03,608 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:03,608 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:03,608 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:03,609 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:03,609 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:03,609 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:03,609 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:03,609 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:03,609 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:03,609 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:03,609 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:03,610 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:03,610 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:03,610 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:03,610 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:03,610 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:03,610 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:03,611 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:03,611 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:03,611 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:03,611 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:03,611 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:03,611 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-10 15:26:03,611 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-10 15:26:03,611 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:26:03,612 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:26:03,612 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:03,612 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:03,612 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:03,612 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-10 15:26:03,612 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-10 15:26:03,612 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:26:03,613 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:26:03,613 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:03,613 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:03,613 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 15:26:03,613 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:03,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:03 BoogieIcfgContainer [2020-07-10 15:26:03,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:03,619 INFO L168 Benchmark]: Toolchain (without parser) took 2728.85 ms. Allocated memory was 139.5 MB in the beginning and 234.4 MB in the end (delta: 94.9 MB). Free memory was 104.4 MB in the beginning and 115.9 MB in the end (delta: -11.5 MB). Peak memory consumption was 83.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:03,620 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:03,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.10 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 93.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:03,622 INFO L168 Benchmark]: Boogie Preprocessor took 149.09 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 93.3 MB in the beginning and 182.1 MB in the end (delta: -88.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:03,623 INFO L168 Benchmark]: RCFGBuilder took 509.82 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 157.3 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:03,624 INFO L168 Benchmark]: TraceAbstraction took 1786.37 ms. Allocated memory was 204.5 MB in the beginning and 234.4 MB in the end (delta: 29.9 MB). Free memory was 156.7 MB in the beginning and 115.9 MB in the end (delta: 40.7 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:03,628 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 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 278.10 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 93.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.09 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 93.3 MB in the beginning and 182.1 MB in the end (delta: -88.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 509.82 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 157.3 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1786.37 ms. Allocated memory was 204.5 MB in the beginning and 234.4 MB in the end (delta: 29.9 MB). Free memory was 156.7 MB in the beginning and 115.9 MB in the end (delta: 40.7 MB). Peak memory consumption was 70.6 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] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L29] COND TRUE i