/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/condnf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:20:55,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:20:55,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:20:55,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:20:55,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:20:55,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:20:55,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:20:55,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:20:55,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:20:55,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:20:55,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:20:55,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:20:55,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:20:55,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:20:55,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:20:55,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:20:55,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:20:55,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:20:55,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:20:55,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:20:55,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:20:55,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:20:55,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:20:55,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:20:55,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:20:55,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:20:55,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:20:55,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:20:55,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:20:55,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:20:55,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:20:55,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:20:55,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:20:55,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:20:55,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:20:55,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:20:55,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:20:55,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:20:55,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:20:55,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:20:55,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:20:55,878 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:55,888 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:20:55,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:20:55,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:20:55,890 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:20:55,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:20:55,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:20:55,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:20:55,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:20:55,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:20:55,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:20:55,891 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:20:55,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:20:55,892 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:20:55,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:20:55,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:20:55,893 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:20:55,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:20:55,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:20:55,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:55,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:20:55,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:20:55,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:20:55,894 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:20:56,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:20:56,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:20:56,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:20:56,235 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:20:56,235 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:20:56,236 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condnf.c [2020-07-10 20:20:56,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3dff23aa/38cbb80b511849838a3a0c764f3391a5/FLAGc84399c64 [2020-07-10 20:20:56,852 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:20:56,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condnf.c [2020-07-10 20:20:56,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3dff23aa/38cbb80b511849838a3a0c764f3391a5/FLAGc84399c64 [2020-07-10 20:20:57,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3dff23aa/38cbb80b511849838a3a0c764f3391a5 [2020-07-10 20:20:57,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:20:57,186 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:20:57,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:57,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:20:57,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:20:57,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:57" (1/1) ... [2020-07-10 20:20:57,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e15001a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:57, skipping insertion in model container [2020-07-10 20:20:57,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:57" (1/1) ... [2020-07-10 20:20:57,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:20:57,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:20:57,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:57,456 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:20:57,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:57,501 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:20:57,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:57 WrapperNode [2020-07-10 20:20:57,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:57,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:20:57,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:20:57,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:20:57,617 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:57" (1/1) ... [2020-07-10 20:20:57,617 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:57" (1/1) ... [2020-07-10 20:20:57,627 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:57" (1/1) ... [2020-07-10 20:20:57,628 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:57" (1/1) ... [2020-07-10 20:20:57,653 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:57" (1/1) ... [2020-07-10 20:20:57,660 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:57" (1/1) ... [2020-07-10 20:20:57,662 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:57" (1/1) ... [2020-07-10 20:20:57,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:20:57,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:20:57,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:20:57,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:20:57,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:57" (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:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:20:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:20:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:20:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:20:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:20:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:20:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:20:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:20:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:20:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:20:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:20:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:20:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:20:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:20:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:20:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:20:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:20:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:20:58,225 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:20:58,225 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:20:58,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:58 BoogieIcfgContainer [2020-07-10 20:20:58,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:20:58,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:20:58,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:20:58,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:20:58,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:20:57" (1/3) ... [2020-07-10 20:20:58,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3105b526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:58, skipping insertion in model container [2020-07-10 20:20:58,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:57" (2/3) ... [2020-07-10 20:20:58,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3105b526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:58, skipping insertion in model container [2020-07-10 20:20:58,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:58" (3/3) ... [2020-07-10 20:20:58,240 INFO L109 eAbstractionObserver]: Analyzing ICFG condnf.c [2020-07-10 20:20:58,252 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:20:58,267 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:20:58,296 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:20:58,319 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:20:58,320 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:20:58,320 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:20:58,320 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:20:58,320 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:20:58,321 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:20:58,321 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:20:58,321 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:20:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2020-07-10 20:20:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:20:58,350 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:58,351 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] [2020-07-10 20:20:58,351 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:58,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:58,357 INFO L82 PathProgramCache]: Analyzing trace with hash -386984160, now seen corresponding path program 1 times [2020-07-10 20:20:58,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:58,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [768237281] [2020-07-10 20:20:58,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:58,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#(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; {65#true} is VALID [2020-07-10 20:20:58,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#true} #valid := #valid[0 := 0]; {65#true} is VALID [2020-07-10 20:20:58,617 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} assume 0 < #StackHeapBarrier; {65#true} is VALID [2020-07-10 20:20:58,618 INFO L280 TraceCheckUtils]: 3: Hoare triple {65#true} ~N~0 := 0; {65#true} is VALID [2020-07-10 20:20:58,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-10 20:20:58,619 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {65#true} {65#true} #113#return; {65#true} is VALID [2020-07-10 20:20:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:58,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#true} ~cond := #in~cond; {65#true} is VALID [2020-07-10 20:20:58,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#true} assume !(0 == ~cond); {65#true} is VALID [2020-07-10 20:20:58,633 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-10 20:20:58,633 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {65#true} {65#true} #109#return; {65#true} is VALID [2020-07-10 20:20:58,636 INFO L263 TraceCheckUtils]: 0: Hoare triple {65#true} call ULTIMATE.init(); {77#(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:58,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#(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; {65#true} is VALID [2020-07-10 20:20:58,637 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} #valid := #valid[0 := 0]; {65#true} is VALID [2020-07-10 20:20:58,637 INFO L280 TraceCheckUtils]: 3: Hoare triple {65#true} assume 0 < #StackHeapBarrier; {65#true} is VALID [2020-07-10 20:20:58,638 INFO L280 TraceCheckUtils]: 4: Hoare triple {65#true} ~N~0 := 0; {65#true} is VALID [2020-07-10 20:20:58,638 INFO L280 TraceCheckUtils]: 5: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-10 20:20:58,639 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {65#true} {65#true} #113#return; {65#true} is VALID [2020-07-10 20:20:58,639 INFO L263 TraceCheckUtils]: 7: Hoare triple {65#true} call #t~ret9 := main(); {65#true} is VALID [2020-07-10 20:20:58,639 INFO L280 TraceCheckUtils]: 8: Hoare triple {65#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {65#true} is VALID [2020-07-10 20:20:58,640 INFO L280 TraceCheckUtils]: 9: Hoare triple {65#true} ~N~0 := #t~nondet0; {65#true} is VALID [2020-07-10 20:20:58,640 INFO L280 TraceCheckUtils]: 10: Hoare triple {65#true} havoc #t~nondet0; {65#true} is VALID [2020-07-10 20:20:58,641 INFO L280 TraceCheckUtils]: 11: Hoare triple {65#true} assume !(~N~0 <= 0); {65#true} is VALID [2020-07-10 20:20:58,641 INFO L263 TraceCheckUtils]: 12: Hoare triple {65#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {65#true} is VALID [2020-07-10 20:20:58,642 INFO L280 TraceCheckUtils]: 13: Hoare triple {65#true} ~cond := #in~cond; {65#true} is VALID [2020-07-10 20:20:58,642 INFO L280 TraceCheckUtils]: 14: Hoare triple {65#true} assume !(0 == ~cond); {65#true} is VALID [2020-07-10 20:20:58,643 INFO L280 TraceCheckUtils]: 15: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-10 20:20:58,643 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {65#true} {65#true} #109#return; {65#true} is VALID [2020-07-10 20:20:58,643 INFO L280 TraceCheckUtils]: 17: Hoare triple {65#true} havoc ~i~0; {65#true} is VALID [2020-07-10 20:20:58,644 INFO L280 TraceCheckUtils]: 18: Hoare triple {65#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26 {65#true} is VALID [2020-07-10 20:20:58,644 INFO L280 TraceCheckUtils]: 19: Hoare triple {65#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {65#true} is VALID [2020-07-10 20:20:58,645 INFO L280 TraceCheckUtils]: 20: Hoare triple {65#true} ~i~0 := 0; {65#true} is VALID [2020-07-10 20:20:58,646 INFO L280 TraceCheckUtils]: 21: Hoare triple {65#true} assume !true; {66#false} is VALID [2020-07-10 20:20:58,647 INFO L280 TraceCheckUtils]: 22: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2020-07-10 20:20:58,647 INFO L280 TraceCheckUtils]: 23: Hoare triple {66#false} assume !true; {66#false} is VALID [2020-07-10 20:20:58,648 INFO L280 TraceCheckUtils]: 24: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2020-07-10 20:20:58,648 INFO L280 TraceCheckUtils]: 25: Hoare triple {66#false} assume !!(~i~0 < ~N~0); {66#false} is VALID [2020-07-10 20:20:58,649 INFO L280 TraceCheckUtils]: 26: Hoare triple {66#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {66#false} is VALID [2020-07-10 20:20:58,649 INFO L263 TraceCheckUtils]: 27: Hoare triple {66#false} call __VERIFIER_assert((if #t~mem8 <= ~N~0 then 1 else 0)); {66#false} is VALID [2020-07-10 20:20:58,650 INFO L280 TraceCheckUtils]: 28: Hoare triple {66#false} ~cond := #in~cond; {66#false} is VALID [2020-07-10 20:20:58,650 INFO L280 TraceCheckUtils]: 29: Hoare triple {66#false} assume 0 == ~cond; {66#false} is VALID [2020-07-10 20:20:58,651 INFO L280 TraceCheckUtils]: 30: Hoare triple {66#false} assume !false; {66#false} is VALID [2020-07-10 20:20:58,656 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:58,656 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:58,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [768237281] [2020-07-10 20:20:58,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:58,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:20:58,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334048327] [2020-07-10 20:20:58,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 20:20:58,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:58,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:20:58,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:58,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:20:58,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:58,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:20:58,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:20:58,759 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2020-07-10 20:20:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:59,158 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2020-07-10 20:20:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:20:59,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 20:20:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2020-07-10 20:20:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2020-07-10 20:20:59,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2020-07-10 20:20:59,368 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:59,382 INFO L225 Difference]: With dead ends: 107 [2020-07-10 20:20:59,383 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 20:20:59,387 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:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 20:20:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-10 20:20:59,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:59,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-10 20:20:59,486 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-10 20:20:59,486 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-10 20:20:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:59,492 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-10 20:20:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-10 20:20:59,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:59,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:59,494 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-10 20:20:59,494 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-10 20:20:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:59,502 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-10 20:20:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-10 20:20:59,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:59,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:59,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:59,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 20:20:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-10 20:20:59,518 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 31 [2020-07-10 20:20:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:59,519 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-10 20:20:59,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:20:59,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2020-07-10 20:20:59,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-10 20:20:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:20:59,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:59,619 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] [2020-07-10 20:20:59,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:20:59,620 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:59,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:59,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1278196063, now seen corresponding path program 1 times [2020-07-10 20:20:59,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:59,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [69919134] [2020-07-10 20:20:59,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:59,802 INFO L280 TraceCheckUtils]: 0: Hoare triple {528#(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; {514#true} is VALID [2020-07-10 20:20:59,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} #valid := #valid[0 := 0]; {514#true} is VALID [2020-07-10 20:20:59,803 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-10 20:20:59,804 INFO L280 TraceCheckUtils]: 3: Hoare triple {514#true} ~N~0 := 0; {514#true} is VALID [2020-07-10 20:20:59,804 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-10 20:20:59,804 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {514#true} {514#true} #113#return; {514#true} is VALID [2020-07-10 20:20:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:59,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2020-07-10 20:20:59,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2020-07-10 20:20:59,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-10 20:20:59,817 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {514#true} {522#(<= 1 ~N~0)} #109#return; {522#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:59,819 INFO L263 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {528#(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:59,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {528#(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; {514#true} is VALID [2020-07-10 20:20:59,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} #valid := #valid[0 := 0]; {514#true} is VALID [2020-07-10 20:20:59,820 INFO L280 TraceCheckUtils]: 3: Hoare triple {514#true} assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-10 20:20:59,820 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#true} ~N~0 := 0; {514#true} is VALID [2020-07-10 20:20:59,821 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-10 20:20:59,821 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {514#true} {514#true} #113#return; {514#true} is VALID [2020-07-10 20:20:59,821 INFO L263 TraceCheckUtils]: 7: Hoare triple {514#true} call #t~ret9 := main(); {514#true} is VALID [2020-07-10 20:20:59,822 INFO L280 TraceCheckUtils]: 8: Hoare triple {514#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {514#true} is VALID [2020-07-10 20:20:59,822 INFO L280 TraceCheckUtils]: 9: Hoare triple {514#true} ~N~0 := #t~nondet0; {514#true} is VALID [2020-07-10 20:20:59,822 INFO L280 TraceCheckUtils]: 10: Hoare triple {514#true} havoc #t~nondet0; {514#true} is VALID [2020-07-10 20:20:59,824 INFO L280 TraceCheckUtils]: 11: Hoare triple {514#true} assume !(~N~0 <= 0); {522#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:59,824 INFO L263 TraceCheckUtils]: 12: Hoare triple {522#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {514#true} is VALID [2020-07-10 20:20:59,824 INFO L280 TraceCheckUtils]: 13: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2020-07-10 20:20:59,825 INFO L280 TraceCheckUtils]: 14: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2020-07-10 20:20:59,825 INFO L280 TraceCheckUtils]: 15: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-10 20:20:59,827 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {514#true} {522#(<= 1 ~N~0)} #109#return; {522#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:59,828 INFO L280 TraceCheckUtils]: 17: Hoare triple {522#(<= 1 ~N~0)} havoc ~i~0; {522#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:59,829 INFO L280 TraceCheckUtils]: 18: Hoare triple {522#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26 {522#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:59,829 INFO L280 TraceCheckUtils]: 19: Hoare triple {522#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {522#(<= 1 ~N~0)} is VALID [2020-07-10 20:20:59,830 INFO L280 TraceCheckUtils]: 20: Hoare triple {522#(<= 1 ~N~0)} ~i~0 := 0; {527#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:20:59,831 INFO L280 TraceCheckUtils]: 21: Hoare triple {527#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {515#false} is VALID [2020-07-10 20:20:59,832 INFO L280 TraceCheckUtils]: 22: Hoare triple {515#false} ~i~0 := 0; {515#false} is VALID [2020-07-10 20:20:59,832 INFO L280 TraceCheckUtils]: 23: Hoare triple {515#false} assume !(~i~0 < ~N~0); {515#false} is VALID [2020-07-10 20:20:59,833 INFO L280 TraceCheckUtils]: 24: Hoare triple {515#false} ~i~0 := 0; {515#false} is VALID [2020-07-10 20:20:59,833 INFO L280 TraceCheckUtils]: 25: Hoare triple {515#false} assume !!(~i~0 < ~N~0); {515#false} is VALID [2020-07-10 20:20:59,833 INFO L280 TraceCheckUtils]: 26: Hoare triple {515#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {515#false} is VALID [2020-07-10 20:20:59,834 INFO L263 TraceCheckUtils]: 27: Hoare triple {515#false} call __VERIFIER_assert((if #t~mem8 <= ~N~0 then 1 else 0)); {515#false} is VALID [2020-07-10 20:20:59,834 INFO L280 TraceCheckUtils]: 28: Hoare triple {515#false} ~cond := #in~cond; {515#false} is VALID [2020-07-10 20:20:59,834 INFO L280 TraceCheckUtils]: 29: Hoare triple {515#false} assume 0 == ~cond; {515#false} is VALID [2020-07-10 20:20:59,834 INFO L280 TraceCheckUtils]: 30: Hoare triple {515#false} assume !false; {515#false} is VALID [2020-07-10 20:20:59,837 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:59,837 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:59,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [69919134] [2020-07-10 20:20:59,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:59,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:20:59,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112505573] [2020-07-10 20:20:59,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-10 20:20:59,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:59,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:20:59,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:20:59,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:20:59,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:59,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:20:59,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:20:59,881 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2020-07-10 20:21:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:00,523 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-07-10 20:21:00,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:00,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-10 20:21:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2020-07-10 20:21:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2020-07-10 20:21:00,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2020-07-10 20:21:00,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:00,685 INFO L225 Difference]: With dead ends: 105 [2020-07-10 20:21:00,685 INFO L226 Difference]: Without dead ends: 78 [2020-07-10 20:21:00,687 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:21:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-10 20:21:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2020-07-10 20:21:00,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:00,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 57 states. [2020-07-10 20:21:00,784 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 57 states. [2020-07-10 20:21:00,784 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 57 states. [2020-07-10 20:21:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:00,791 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2020-07-10 20:21:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2020-07-10 20:21:00,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:00,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:00,793 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 78 states. [2020-07-10 20:21:00,793 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 78 states. [2020-07-10 20:21:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:00,798 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2020-07-10 20:21:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2020-07-10 20:21:00,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:00,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:00,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:00,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 20:21:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-07-10 20:21:00,804 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 31 [2020-07-10 20:21:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:00,804 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-07-10 20:21:00,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:00,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2020-07-10 20:21:00,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-07-10 20:21:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 20:21:00,888 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:00,888 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] [2020-07-10 20:21:00,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:00,889 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:00,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:00,889 INFO L82 PathProgramCache]: Analyzing trace with hash -620119431, now seen corresponding path program 1 times [2020-07-10 20:21:00,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:00,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1520366772] [2020-07-10 20:21:00,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:00,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:00,931 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:21:00,939 INFO L168 Benchmark]: Toolchain (without parser) took 3752.29 ms. Allocated memory was 142.6 MB in the beginning and 252.7 MB in the end (delta: 110.1 MB). Free memory was 101.2 MB in the beginning and 130.4 MB in the end (delta: -29.2 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:00,940 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:00,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.36 ms. Allocated memory is still 142.6 MB. Free memory was 101.0 MB in the beginning and 89.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:00,942 INFO L168 Benchmark]: Boogie Preprocessor took 161.81 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 89.7 MB in the beginning and 178.2 MB in the end (delta: -88.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:00,943 INFO L168 Benchmark]: RCFGBuilder took 565.55 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 149.3 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:00,944 INFO L168 Benchmark]: TraceAbstraction took 2703.46 ms. Allocated memory was 200.8 MB in the beginning and 252.7 MB in the end (delta: 51.9 MB). Free memory was 149.3 MB in the beginning and 130.4 MB in the end (delta: 18.9 MB). Peak memory consumption was 70.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:00,948 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.28 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 315.36 ms. Allocated memory is still 142.6 MB. Free memory was 101.0 MB in the beginning and 89.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.81 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 89.7 MB in the beginning and 178.2 MB in the end (delta: -88.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 565.55 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 149.3 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2703.46 ms. Allocated memory was 200.8 MB in the beginning and 252.7 MB in the end (delta: 51.9 MB). Free memory was 149.3 MB in the beginning and 130.4 MB in the end (delta: 18.9 MB). Peak memory consumption was 70.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...