/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/ms1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:29,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:29,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:29,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:29,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:29,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:29,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:29,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:29,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:29,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:29,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:29,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:29,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:29,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:29,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:29,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:30,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:30,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:30,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:30,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:30,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:30,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:30,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:30,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:30,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:30,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:30,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:30,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:30,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:30,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:30,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:30,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:30,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:30,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:30,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:30,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:30,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:30,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:30,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:30,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:30,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:30,038 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:26:30,064 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:30,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:30,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:30,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:30,068 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:30,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:30,068 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:30,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:30,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:30,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:30,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:30,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:30,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:30,069 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:30,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:30,070 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:30,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:30,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:30,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:30,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:30,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:30,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:30,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:30,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:30,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:30,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:30,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:30,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:30,074 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:30,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:30,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:30,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:30,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:30,389 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:30,389 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:30,390 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ms1f.c [2020-07-10 15:26:30,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3cd676aa/ed076f7afb5847f9967171afc1d1b53e/FLAGfa0e05ec8 [2020-07-10 15:26:30,945 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:30,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms1f.c [2020-07-10 15:26:30,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3cd676aa/ed076f7afb5847f9967171afc1d1b53e/FLAGfa0e05ec8 [2020-07-10 15:26:31,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3cd676aa/ed076f7afb5847f9967171afc1d1b53e [2020-07-10 15:26:31,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:31,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:31,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:31,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:31,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:31,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:31" (1/1) ... [2020-07-10 15:26:31,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b570901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:31, skipping insertion in model container [2020-07-10 15:26:31,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:31" (1/1) ... [2020-07-10 15:26:31,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:31,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:31,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:31,596 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:31,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:31,636 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:31,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:31 WrapperNode [2020-07-10 15:26:31,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:31,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:31,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:31,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:31,733 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:31" (1/1) ... [2020-07-10 15:26:31,734 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:31" (1/1) ... [2020-07-10 15:26:31,742 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:31" (1/1) ... [2020-07-10 15:26:31,743 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:31" (1/1) ... [2020-07-10 15:26:31,753 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:31" (1/1) ... [2020-07-10 15:26:31,759 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:31" (1/1) ... [2020-07-10 15:26:31,760 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:31" (1/1) ... [2020-07-10 15:26:31,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:31,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:31,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:31,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:31,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:31" (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:31,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:31,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:31,820 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:31,820 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:31,820 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:31,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:32,217 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:32,217 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:26:32,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:32 BoogieIcfgContainer [2020-07-10 15:26:32,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:32,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:32,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:32,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:32,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:31" (1/3) ... [2020-07-10 15:26:32,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74586f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:32, skipping insertion in model container [2020-07-10 15:26:32,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:31" (2/3) ... [2020-07-10 15:26:32,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74586f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:32, skipping insertion in model container [2020-07-10 15:26:32,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:32" (3/3) ... [2020-07-10 15:26:32,229 INFO L109 eAbstractionObserver]: Analyzing ICFG ms1f.c [2020-07-10 15:26:32,239 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:32,248 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:32,258 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:32,281 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:32,281 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:32,281 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:32,282 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:32,282 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:32,282 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:32,282 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:32,282 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-10 15:26:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:26:32,307 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:32,308 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:32,308 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash -432131487, now seen corresponding path program 1 times [2020-07-10 15:26:32,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:32,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626017562] [2020-07-10 15:26:32,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:32,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {35#true} is VALID [2020-07-10 15:26:32,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 15:26:32,555 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-10 15:26:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:32,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-10 15:26:32,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-10 15:26:32,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-10 15:26:32,567 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-10 15:26:32,569 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:32,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {35#true} is VALID [2020-07-10 15:26:32,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 15:26:32,571 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-10 15:26:32,571 INFO L263 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2020-07-10 15:26:32,571 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {35#true} is VALID [2020-07-10 15:26:32,572 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~N~0 <= 0); {35#true} is VALID [2020-07-10 15:26:32,572 INFO L263 TraceCheckUtils]: 7: Hoare triple {35#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {35#true} is VALID [2020-07-10 15:26:32,573 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-10 15:26:32,574 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-10 15:26:32,574 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-10 15:26:32,575 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-10 15:26:32,575 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#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;~i~0 := 0; {36#false} is VALID [2020-07-10 15:26:32,576 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-10 15:26:32,576 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2020-07-10 15:26:32,577 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-10 15:26:32,577 INFO L280 TraceCheckUtils]: 16: Hoare triple {36#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 4); {36#false} is VALID [2020-07-10 15:26:32,577 INFO L263 TraceCheckUtils]: 17: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem6 == ~N~0 then 1 else 0)); {36#false} is VALID [2020-07-10 15:26:32,578 INFO L280 TraceCheckUtils]: 18: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2020-07-10 15:26:32,578 INFO L280 TraceCheckUtils]: 19: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2020-07-10 15:26:32,579 INFO L280 TraceCheckUtils]: 20: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-10 15:26:32,582 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:32,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626017562] [2020-07-10 15:26:32,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:32,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:32,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590990030] [2020-07-10 15:26:32,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:26:32,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:32,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:32,638 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:32,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:32,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:32,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:32,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:32,652 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-10 15:26:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:32,832 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2020-07-10 15:26:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:32,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:26:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-10 15:26:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-10 15:26:32,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2020-07-10 15:26:32,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:32,977 INFO L225 Difference]: With dead ends: 54 [2020-07-10 15:26:32,978 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 15:26:32,981 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:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 15:26:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 15:26:33,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:33,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:33,051 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:33,052 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:33,056 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:26:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:26:33,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:33,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:33,057 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:33,058 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:33,061 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:26:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:26:33,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:33,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:33,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:33,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:26:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-10 15:26:33,067 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2020-07-10 15:26:33,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:33,068 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-10 15:26:33,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:26:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:26:33,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:33,069 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:33,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:33,070 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:33,070 INFO L82 PathProgramCache]: Analyzing trace with hash -173966049, now seen corresponding path program 1 times [2020-07-10 15:26:33,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:33,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941084245] [2020-07-10 15:26:33,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:33,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {200#true} is VALID [2020-07-10 15:26:33,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:33,234 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-10 15:26:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:33,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-10 15:26:33,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-10 15:26:33,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:33,254 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:33,258 INFO L263 TraceCheckUtils]: 0: Hoare triple {200#true} call ULTIMATE.init(); {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:33,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {200#true} is VALID [2020-07-10 15:26:33,258 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:33,259 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-10 15:26:33,259 INFO L263 TraceCheckUtils]: 4: Hoare triple {200#true} call #t~ret7 := main(); {200#true} is VALID [2020-07-10 15:26:33,259 INFO L280 TraceCheckUtils]: 5: Hoare triple {200#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {200#true} is VALID [2020-07-10 15:26:33,260 INFO L280 TraceCheckUtils]: 6: Hoare triple {200#true} assume !(~N~0 <= 0); {205#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:33,261 INFO L263 TraceCheckUtils]: 7: Hoare triple {205#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {200#true} is VALID [2020-07-10 15:26:33,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-10 15:26:33,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-10 15:26:33,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:33,263 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:33,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {205#(<= 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;~i~0 := 0; {210#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:33,265 INFO L280 TraceCheckUtils]: 13: Hoare triple {210#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-10 15:26:33,265 INFO L280 TraceCheckUtils]: 14: Hoare triple {201#false} ~i~0 := 0; {201#false} is VALID [2020-07-10 15:26:33,266 INFO L280 TraceCheckUtils]: 15: Hoare triple {201#false} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-10 15:26:33,266 INFO L280 TraceCheckUtils]: 16: Hoare triple {201#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 4); {201#false} is VALID [2020-07-10 15:26:33,266 INFO L263 TraceCheckUtils]: 17: Hoare triple {201#false} call __VERIFIER_assert((if #t~mem6 == ~N~0 then 1 else 0)); {201#false} is VALID [2020-07-10 15:26:33,266 INFO L280 TraceCheckUtils]: 18: Hoare triple {201#false} ~cond := #in~cond; {201#false} is VALID [2020-07-10 15:26:33,267 INFO L280 TraceCheckUtils]: 19: Hoare triple {201#false} assume 0 == ~cond; {201#false} is VALID [2020-07-10 15:26:33,267 INFO L280 TraceCheckUtils]: 20: Hoare triple {201#false} assume !false; {201#false} is VALID [2020-07-10 15:26:33,268 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:33,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941084245] [2020-07-10 15:26:33,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:33,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:33,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184488409] [2020-07-10 15:26:33,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:26:33,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:33,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:33,297 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:33,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:33,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:33,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:33,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:33,299 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2020-07-10 15:26:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:33,506 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-10 15:26:33,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:33,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:26:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-10 15:26:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-10 15:26:33,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2020-07-10 15:26:33,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:33,574 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:26:33,574 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:26:33,575 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:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:26:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-10 15:26:33,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:33,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-10 15:26:33,603 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-10 15:26:33,603 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-10 15:26:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:33,606 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-10 15:26:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-10 15:26:33,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:33,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:33,607 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-10 15:26:33,607 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-10 15:26:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:33,610 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-10 15:26:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-10 15:26:33,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:33,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:33,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:33,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:26:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-10 15:26:33,614 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2020-07-10 15:26:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:33,614 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-10 15:26:33,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-10 15:26:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:26:33,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:33,616 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-10 15:26:33,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:33,616 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash -445719797, now seen corresponding path program 1 times [2020-07-10 15:26:33,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:33,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687819713] [2020-07-10 15:26:33,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:33,732 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:33,733 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:33,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:26:33,798 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:33,798 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:33,798 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:33,799 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:33,799 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:33,799 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:33,799 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:33,799 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:33,799 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:33,799 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:33,800 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:33,800 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:33,800 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:33,800 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:33,800 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:33,800 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:33,800 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:33,804 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:33,804 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:33,804 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:33,805 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:33,811 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:33,812 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:33,812 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:33,813 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:33,813 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:33,813 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:33,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:33,813 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:33,813 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:33,813 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:33,814 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-10 15:26:33,814 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-10 15:26:33,814 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-10 15:26:33,814 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2020-07-10 15:26:33,814 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2020-07-10 15:26:33,814 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2020-07-10 15:26:33,814 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2020-07-10 15:26:33,815 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 15:26:33,815 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 15:26:33,815 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:26:33,815 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:26:33,815 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2020-07-10 15:26:33,815 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:33,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:33 BoogieIcfgContainer [2020-07-10 15:26:33,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:33,824 INFO L168 Benchmark]: Toolchain (without parser) took 2447.99 ms. Allocated memory was 144.7 MB in the beginning and 233.3 MB in the end (delta: 88.6 MB). Free memory was 102.5 MB in the beginning and 123.8 MB in the end (delta: -21.3 MB). Peak memory consumption was 67.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,826 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 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:33,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.94 ms. Allocated memory is still 144.7 MB. Free memory was 102.3 MB in the beginning and 91.1 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,828 INFO L168 Benchmark]: Boogie Preprocessor took 125.50 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 91.1 MB in the beginning and 178.7 MB in the end (delta: -87.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,830 INFO L168 Benchmark]: RCFGBuilder took 458.35 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 154.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,832 INFO L168 Benchmark]: TraceAbstraction took 1597.80 ms. Allocated memory was 201.3 MB in the beginning and 233.3 MB in the end (delta: 32.0 MB). Free memory was 154.3 MB in the beginning and 123.8 MB in the end (delta: 30.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:33,843 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 1.36 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.94 ms. Allocated memory is still 144.7 MB. Free memory was 102.3 MB in the beginning and 91.1 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.50 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 91.1 MB in the beginning and 178.7 MB in the end (delta: -87.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 458.35 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 154.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1597.80 ms. Allocated memory was 201.3 MB in the beginning and 233.3 MB in the end (delta: 32.0 MB). Free memory was 154.3 MB in the beginning and 123.8 MB in the end (delta: 30.4 MB). Peak memory consumption was 62.4 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] 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