/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/condaf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:20:52,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:20:52,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:20:52,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:20:52,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:20:52,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:20:52,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:20:52,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:20:52,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:20:52,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:20:52,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:20:52,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:20:52,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:20:52,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:20:52,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:20:52,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:20:52,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:20:52,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:20:52,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:20:53,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:20:53,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:20:53,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:20:53,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:20:53,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:20:53,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:20:53,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:20:53,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:20:53,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:20:53,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:20:53,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:20:53,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:20:53,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:20:53,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:20:53,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:20:53,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:20:53,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:20:53,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:20:53,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:20:53,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:20:53,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:20:53,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:20:53,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:20:53,061 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:20:53,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:20:53,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:20:53,065 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:20:53,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:20:53,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:20:53,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:20:53,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:20:53,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:20:53,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:20:53,069 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:20:53,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:20:53,070 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:20:53,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:20:53,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:20:53,070 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:20:53,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:20:53,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:20:53,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:53,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:20:53,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:20:53,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:20:53,072 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:20:53,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:20:53,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:20:53,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:20:53,349 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:20:53,349 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:20:53,350 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condaf.c [2020-07-10 20:20:53,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ea1ba10/3a4b55d0a7794d048bda8890fde4c82d/FLAG9d79d6a7a [2020-07-10 20:20:53,921 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:20:53,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condaf.c [2020-07-10 20:20:53,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ea1ba10/3a4b55d0a7794d048bda8890fde4c82d/FLAG9d79d6a7a [2020-07-10 20:20:54,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ea1ba10/3a4b55d0a7794d048bda8890fde4c82d [2020-07-10 20:20:54,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:20:54,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:20:54,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:54,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:20:54,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:20:54,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:54" (1/1) ... [2020-07-10 20:20:54,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2452879e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54, skipping insertion in model container [2020-07-10 20:20:54,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:54" (1/1) ... [2020-07-10 20:20:54,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:20:54,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:20:54,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:54,598 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:20:54,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:54,722 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:20:54,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54 WrapperNode [2020-07-10 20:20:54,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:54,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:20:54,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:20:54,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:20:54,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54" (1/1) ... [2020-07-10 20:20:54,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54" (1/1) ... [2020-07-10 20:20:54,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54" (1/1) ... [2020-07-10 20:20:54,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54" (1/1) ... [2020-07-10 20:20:54,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54" (1/1) ... [2020-07-10 20:20:54,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54" (1/1) ... [2020-07-10 20:20:54,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54" (1/1) ... [2020-07-10 20:20:54,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:20:54,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:20:54,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:20:54,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:20:54,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54" (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 20:20:54,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:20:54,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:20:54,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:20:54,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:20:54,842 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:20:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:20:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:20:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:20:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:20:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:20:54,843 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:20:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:20:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:20:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:20:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:20:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:20:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:20:54,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:20:54,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:20:55,337 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:20:55,338 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:20:55,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:55 BoogieIcfgContainer [2020-07-10 20:20:55,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:20:55,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:20:55,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:20:55,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:20:55,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:20:54" (1/3) ... [2020-07-10 20:20:55,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ce256c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:55, skipping insertion in model container [2020-07-10 20:20:55,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:54" (2/3) ... [2020-07-10 20:20:55,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ce256c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:55, skipping insertion in model container [2020-07-10 20:20:55,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:55" (3/3) ... [2020-07-10 20:20:55,357 INFO L109 eAbstractionObserver]: Analyzing ICFG condaf.c [2020-07-10 20:20:55,367 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:20:55,375 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:20:55,388 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:20:55,407 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:20:55,408 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:20:55,408 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:20:55,408 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:20:55,408 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:20:55,408 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:20:55,408 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:20:55,409 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:20:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2020-07-10 20:20:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:20:55,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:55,433 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, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:55,433 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:55,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:55,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2050446892, now seen corresponding path program 1 times [2020-07-10 20:20:55,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:55,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [438559715] [2020-07-10 20:20:55,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:55,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#(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; {74#true} is VALID [2020-07-10 20:20:55,691 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-10 20:20:55,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-10 20:20:55,693 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-10 20:20:55,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-10 20:20:55,695 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {74#true} {74#true} #122#return; {74#true} is VALID [2020-07-10 20:20:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:55,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-10 20:20:55,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-10 20:20:55,716 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-10 20:20:55,716 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {74#true} {74#true} #118#return; {74#true} is VALID [2020-07-10 20:20:55,718 INFO L263 TraceCheckUtils]: 0: Hoare triple {74#true} call ULTIMATE.init(); {86#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:55,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#(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; {74#true} is VALID [2020-07-10 20:20:55,719 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-10 20:20:55,720 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-10 20:20:55,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-10 20:20:55,720 INFO L280 TraceCheckUtils]: 5: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-10 20:20:55,721 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {74#true} {74#true} #122#return; {74#true} is VALID [2020-07-10 20:20:55,721 INFO L263 TraceCheckUtils]: 7: Hoare triple {74#true} call #t~ret11 := main(); {74#true} is VALID [2020-07-10 20:20:55,723 INFO L280 TraceCheckUtils]: 8: Hoare triple {74#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {74#true} is VALID [2020-07-10 20:20:55,723 INFO L280 TraceCheckUtils]: 9: Hoare triple {74#true} ~N~0 := #t~nondet0; {74#true} is VALID [2020-07-10 20:20:55,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {74#true} havoc #t~nondet0; {74#true} is VALID [2020-07-10 20:20:55,724 INFO L280 TraceCheckUtils]: 11: Hoare triple {74#true} assume !(~N~0 <= 0); {74#true} is VALID [2020-07-10 20:20:55,727 INFO L263 TraceCheckUtils]: 12: Hoare triple {74#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {74#true} is VALID [2020-07-10 20:20:55,727 INFO L280 TraceCheckUtils]: 13: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-10 20:20:55,728 INFO L280 TraceCheckUtils]: 14: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-10 20:20:55,728 INFO L280 TraceCheckUtils]: 15: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-10 20:20:55,729 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {74#true} {74#true} #118#return; {74#true} is VALID [2020-07-10 20:20:55,729 INFO L280 TraceCheckUtils]: 17: Hoare triple {74#true} havoc ~i~0; {74#true} is VALID [2020-07-10 20:20:55,730 INFO L280 TraceCheckUtils]: 18: Hoare triple {74#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {74#true} is VALID [2020-07-10 20:20:55,731 INFO L280 TraceCheckUtils]: 19: Hoare triple {74#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {74#true} is VALID [2020-07-10 20:20:55,732 INFO L280 TraceCheckUtils]: 20: Hoare triple {74#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {74#true} is VALID [2020-07-10 20:20:55,732 INFO L280 TraceCheckUtils]: 21: Hoare triple {74#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {74#true} is VALID [2020-07-10 20:20:55,732 INFO L280 TraceCheckUtils]: 22: Hoare triple {74#true} ~i~0 := 0; {74#true} is VALID [2020-07-10 20:20:55,734 INFO L280 TraceCheckUtils]: 23: Hoare triple {74#true} assume !true; {75#false} is VALID [2020-07-10 20:20:55,734 INFO L280 TraceCheckUtils]: 24: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-10 20:20:55,735 INFO L280 TraceCheckUtils]: 25: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-10 20:20:55,735 INFO L280 TraceCheckUtils]: 26: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-10 20:20:55,735 INFO L280 TraceCheckUtils]: 27: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-10 20:20:55,736 INFO L280 TraceCheckUtils]: 28: Hoare triple {75#false} SUMMARY for call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); srcloc: L44-6 {75#false} is VALID [2020-07-10 20:20:55,736 INFO L263 TraceCheckUtils]: 29: Hoare triple {75#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {75#false} is VALID [2020-07-10 20:20:55,737 INFO L280 TraceCheckUtils]: 30: Hoare triple {75#false} ~cond := #in~cond; {75#false} is VALID [2020-07-10 20:20:55,737 INFO L280 TraceCheckUtils]: 31: Hoare triple {75#false} assume 0 == ~cond; {75#false} is VALID [2020-07-10 20:20:55,738 INFO L280 TraceCheckUtils]: 32: Hoare triple {75#false} assume !false; {75#false} is VALID [2020-07-10 20:20:55,749 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 20:20:55,749 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:55,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [438559715] [2020-07-10 20:20:55,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:55,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:20:55,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509997509] [2020-07-10 20:20:55,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 20:20:55,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:55,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:20:55,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:55,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:20:55,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:55,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:20:55,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:20:55,864 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2020-07-10 20:20:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:56,300 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2020-07-10 20:20:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:20:56,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 20:20:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2020-07-10 20:20:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2020-07-10 20:20:56,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 142 transitions. [2020-07-10 20:20:56,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:56,513 INFO L225 Difference]: With dead ends: 125 [2020-07-10 20:20:56,514 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 20:20:56,518 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 20:20:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 20:20:56,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-10 20:20:56,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:56,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-10 20:20:56,613 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-10 20:20:56,613 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-10 20:20:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:56,619 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-10 20:20:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-10 20:20:56,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:56,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:56,621 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-10 20:20:56,621 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-10 20:20:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:56,627 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-10 20:20:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-10 20:20:56,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:56,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:56,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:56,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 20:20:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2020-07-10 20:20:56,636 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 33 [2020-07-10 20:20:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:56,636 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2020-07-10 20:20:56,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:20:56,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2020-07-10 20:20:56,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-10 20:20:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:20:56,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:56,714 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, 1, 1, 1, 1, 1, 1] [2020-07-10 20:20:56,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:20:56,714 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash -341126016, now seen corresponding path program 1 times [2020-07-10 20:20:56,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:56,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1137072743] [2020-07-10 20:20:56,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:56,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {589#(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; {575#true} is VALID [2020-07-10 20:20:56,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {575#true} #valid := #valid[0 := 0]; {575#true} is VALID [2020-07-10 20:20:56,871 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} assume 0 < #StackHeapBarrier; {575#true} is VALID [2020-07-10 20:20:56,872 INFO L280 TraceCheckUtils]: 3: Hoare triple {575#true} ~N~0 := 0; {575#true} is VALID [2020-07-10 20:20:56,872 INFO L280 TraceCheckUtils]: 4: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-10 20:20:56,872 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {575#true} {575#true} #122#return; {575#true} is VALID [2020-07-10 20:20:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:56,893 INFO L280 TraceCheckUtils]: 0: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2020-07-10 20:20:56,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2020-07-10 20:20:56,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-10 20:20:56,898 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {575#true} {583#(<= 1 ~N~0)} #118#return; {583#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:56,900 INFO L263 TraceCheckUtils]: 0: Hoare triple {575#true} call ULTIMATE.init(); {589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:20:56,900 INFO L280 TraceCheckUtils]: 1: Hoare triple {589#(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; {575#true} is VALID [2020-07-10 20:20:56,901 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} #valid := #valid[0 := 0]; {575#true} is VALID [2020-07-10 20:20:56,901 INFO L280 TraceCheckUtils]: 3: Hoare triple {575#true} assume 0 < #StackHeapBarrier; {575#true} is VALID [2020-07-10 20:20:56,902 INFO L280 TraceCheckUtils]: 4: Hoare triple {575#true} ~N~0 := 0; {575#true} is VALID [2020-07-10 20:20:56,902 INFO L280 TraceCheckUtils]: 5: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-10 20:20:56,902 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {575#true} {575#true} #122#return; {575#true} is VALID [2020-07-10 20:20:56,903 INFO L263 TraceCheckUtils]: 7: Hoare triple {575#true} call #t~ret11 := main(); {575#true} is VALID [2020-07-10 20:20:56,903 INFO L280 TraceCheckUtils]: 8: Hoare triple {575#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {575#true} is VALID [2020-07-10 20:20:56,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {575#true} ~N~0 := #t~nondet0; {575#true} is VALID [2020-07-10 20:20:56,904 INFO L280 TraceCheckUtils]: 10: Hoare triple {575#true} havoc #t~nondet0; {575#true} is VALID [2020-07-10 20:20:56,908 INFO L280 TraceCheckUtils]: 11: Hoare triple {575#true} assume !(~N~0 <= 0); {583#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:56,908 INFO L263 TraceCheckUtils]: 12: Hoare triple {583#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {575#true} is VALID [2020-07-10 20:20:56,908 INFO L280 TraceCheckUtils]: 13: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2020-07-10 20:20:56,909 INFO L280 TraceCheckUtils]: 14: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2020-07-10 20:20:56,909 INFO L280 TraceCheckUtils]: 15: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-10 20:20:56,911 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {575#true} {583#(<= 1 ~N~0)} #118#return; {583#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:56,912 INFO L280 TraceCheckUtils]: 17: Hoare triple {583#(<= 1 ~N~0)} havoc ~i~0; {583#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:56,913 INFO L280 TraceCheckUtils]: 18: Hoare triple {583#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {583#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:56,914 INFO L280 TraceCheckUtils]: 19: Hoare triple {583#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {583#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:56,915 INFO L280 TraceCheckUtils]: 20: Hoare triple {583#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {583#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:56,916 INFO L280 TraceCheckUtils]: 21: Hoare triple {583#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {583#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:56,918 INFO L280 TraceCheckUtils]: 22: Hoare triple {583#(<= 1 ~N~0)} ~i~0 := 0; {588#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:20:56,919 INFO L280 TraceCheckUtils]: 23: Hoare triple {588#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {576#false} is VALID [2020-07-10 20:20:56,919 INFO L280 TraceCheckUtils]: 24: Hoare triple {576#false} ~i~0 := 0; {576#false} is VALID [2020-07-10 20:20:56,920 INFO L280 TraceCheckUtils]: 25: Hoare triple {576#false} assume !(~i~0 < ~N~0); {576#false} is VALID [2020-07-10 20:20:56,920 INFO L280 TraceCheckUtils]: 26: Hoare triple {576#false} ~i~0 := 0; {576#false} is VALID [2020-07-10 20:20:56,920 INFO L280 TraceCheckUtils]: 27: Hoare triple {576#false} assume !(~i~0 < ~N~0); {576#false} is VALID [2020-07-10 20:20:56,921 INFO L280 TraceCheckUtils]: 28: Hoare triple {576#false} SUMMARY for call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); srcloc: L44-6 {576#false} is VALID [2020-07-10 20:20:56,922 INFO L263 TraceCheckUtils]: 29: Hoare triple {576#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {576#false} is VALID [2020-07-10 20:20:56,922 INFO L280 TraceCheckUtils]: 30: Hoare triple {576#false} ~cond := #in~cond; {576#false} is VALID [2020-07-10 20:20:56,923 INFO L280 TraceCheckUtils]: 31: Hoare triple {576#false} assume 0 == ~cond; {576#false} is VALID [2020-07-10 20:20:56,923 INFO L280 TraceCheckUtils]: 32: Hoare triple {576#false} assume !false; {576#false} is VALID [2020-07-10 20:20:56,926 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 20:20:56,928 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:56,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1137072743] [2020-07-10 20:20:56,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:56,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:20:56,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105343145] [2020-07-10 20:20:56,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-10 20:20:56,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:56,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:20:56,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:56,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:20:56,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:20:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:20:56,980 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 5 states. [2020-07-10 20:20:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:57,511 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2020-07-10 20:20:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:20:57,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-10 20:20:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2020-07-10 20:20:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2020-07-10 20:20:57,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2020-07-10 20:20:57,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:57,673 INFO L225 Difference]: With dead ends: 115 [2020-07-10 20:20:57,673 INFO L226 Difference]: Without dead ends: 84 [2020-07-10 20:20:57,675 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 20:20:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-10 20:20:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2020-07-10 20:20:57,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:57,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 62 states. [2020-07-10 20:20:57,778 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 62 states. [2020-07-10 20:20:57,779 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 62 states. [2020-07-10 20:20:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:57,787 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-10 20:20:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2020-07-10 20:20:57,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:57,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:57,789 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 84 states. [2020-07-10 20:20:57,791 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 84 states. [2020-07-10 20:20:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:57,800 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-10 20:20:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2020-07-10 20:20:57,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:57,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:57,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:57,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-10 20:20:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2020-07-10 20:20:57,809 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 33 [2020-07-10 20:20:57,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:57,809 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2020-07-10 20:20:57,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:20:57,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2020-07-10 20:20:57,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-10 20:20:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-10 20:20:57,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:57,897 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, 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, 1, 1, 1] [2020-07-10 20:20:57,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:20:57,897 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:57,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:57,898 INFO L82 PathProgramCache]: Analyzing trace with hash 746418975, now seen corresponding path program 1 times [2020-07-10 20:20:57,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:57,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2134657938] [2020-07-10 20:20:57,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:57,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:20:57,939 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:20:57,945 INFO L168 Benchmark]: Toolchain (without parser) took 3628.95 ms. Allocated memory was 138.9 MB in the beginning and 246.4 MB in the end (delta: 107.5 MB). Free memory was 102.6 MB in the beginning and 102.2 MB in the end (delta: 374.6 kB). Peak memory consumption was 107.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:57,946 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:20:57,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.62 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.6 MB in the beginning and 181.7 MB in the end (delta: -79.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:57,948 INFO L168 Benchmark]: Boogie Preprocessor took 43.33 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 179.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:57,948 INFO L168 Benchmark]: RCFGBuilder took 575.05 ms. Allocated memory is still 202.9 MB. Free memory was 179.5 MB in the beginning and 148.5 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:57,949 INFO L168 Benchmark]: TraceAbstraction took 2596.26 ms. Allocated memory was 202.9 MB in the beginning and 246.4 MB in the end (delta: 43.5 MB). Free memory was 148.5 MB in the beginning and 102.2 MB in the end (delta: 46.3 MB). Peak memory consumption was 89.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:20:57,953 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.25 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 403.62 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.6 MB in the beginning and 181.7 MB in the end (delta: -79.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.33 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 179.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 575.05 ms. Allocated memory is still 202.9 MB. Free memory was 179.5 MB in the beginning and 148.5 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2596.26 ms. Allocated memory was 202.9 MB in the beginning and 246.4 MB in the end (delta: 43.5 MB). Free memory was 148.5 MB in the beginning and 102.2 MB in the end (delta: 46.3 MB). Peak memory consumption was 89.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...