/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/recursive/Addition02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 15:54:51,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:54:51,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:54:51,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:54:51,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:54:51,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:54:51,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:54:51,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:54:51,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:54:51,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:54:51,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:54:51,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:54:51,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:54:51,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:54:51,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:54:51,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:54:51,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:54:51,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:54:51,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:54:51,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:54:51,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:54:51,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:54:51,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:54:51,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:54:51,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:54:51,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:54:51,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:54:51,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:54:51,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:54:51,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:54:51,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:54:51,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:54:51,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:54:51,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:54:51,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:54:51,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:54:51,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:54:51,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:54:51,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:54:51,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:54:51,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:54:51,167 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 15:54:51,196 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:54:51,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:54:51,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:54:51,198 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:54:51,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:54:51,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:54:51,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:54:51,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:54:51,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:54:51,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:54:51,203 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:54:51,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:54:51,203 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:54:51,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:54:51,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:54:51,204 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:54:51,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:54:51,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:54:51,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:54:51,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:54:51,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:54:51,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:54:51,205 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:54:51,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:54:51,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:54:51,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:54:51,494 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:54:51,495 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:54:51,495 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Addition02.c [2020-07-08 15:54:51,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e6a3b30/b0604e8aa54a4ac9b862415fb00f1a04/FLAG7f63a0867 [2020-07-08 15:54:52,037 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:54:52,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Addition02.c [2020-07-08 15:54:52,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e6a3b30/b0604e8aa54a4ac9b862415fb00f1a04/FLAG7f63a0867 [2020-07-08 15:54:52,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e6a3b30/b0604e8aa54a4ac9b862415fb00f1a04 [2020-07-08 15:54:52,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:54:52,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:54:52,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:54:52,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:54:52,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:54:52,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258a1e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52, skipping insertion in model container [2020-07-08 15:54:52,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:54:52,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:54:52,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:54:52,707 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:54:52,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:54:52,752 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:54:52,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52 WrapperNode [2020-07-08 15:54:52,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:54:52,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:54:52,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:54:52,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:54:52,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (1/1) ... [2020-07-08 15:54:52,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:54:52,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:54:52,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:54:52,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:54:52,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (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-08 15:54:52,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:54:52,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:54:52,953 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-08 15:54:52,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:54:52,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:54:52,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 15:54:52,954 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-08 15:54:52,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:54:52,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:54:52,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:54:53,329 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:54:53,329 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 15:54:53,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:54:53 BoogieIcfgContainer [2020-07-08 15:54:53,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:54:53,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:54:53,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:54:53,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:54:53,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:54:52" (1/3) ... [2020-07-08 15:54:53,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bf0129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:54:53, skipping insertion in model container [2020-07-08 15:54:53,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:52" (2/3) ... [2020-07-08 15:54:53,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bf0129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:54:53, skipping insertion in model container [2020-07-08 15:54:53,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:54:53" (3/3) ... [2020-07-08 15:54:53,341 INFO L109 eAbstractionObserver]: Analyzing ICFG Addition02.c [2020-07-08 15:54:53,351 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:54:53,358 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:54:53,371 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:54:53,390 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:54:53,391 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:54:53,391 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:54:53,391 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:54:53,391 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:54:53,391 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:54:53,391 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:54:53,391 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:54:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-08 15:54:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 15:54:53,414 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:53,415 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] [2020-07-08 15:54:53,416 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash 935018920, now seen corresponding path program 1 times [2020-07-08 15:54:53,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:53,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565658382] [2020-07-08 15:54:53,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:53,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-08 15:54:53,777 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45#true} {45#true} #58#return; {45#true} is VALID [2020-07-08 15:54:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:53,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} ~m := #in~m; {58#(= |addition_#in~m| addition_~m)} is VALID [2020-07-08 15:54:53,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= |addition_#in~m| addition_~m)} ~n := #in~n; {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-08 15:54:53,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-08 15:54:53,911 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-08 15:54:53,912 INFO L280 TraceCheckUtils]: 4: Hoare triple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-08 15:54:53,915 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {49#(<= 0 main_~n~0)} #62#return; {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-08 15:54:53,916 INFO L263 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2020-07-08 15:54:53,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-08 15:54:53,917 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #58#return; {45#true} is VALID [2020-07-08 15:54:53,917 INFO L263 TraceCheckUtils]: 3: Hoare triple {45#true} call #t~ret5 := main(); {45#true} is VALID [2020-07-08 15:54:53,918 INFO L280 TraceCheckUtils]: 4: Hoare triple {45#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {45#true} is VALID [2020-07-08 15:54:53,918 INFO L280 TraceCheckUtils]: 5: Hoare triple {45#true} ~m~0 := #t~nondet2; {45#true} is VALID [2020-07-08 15:54:53,919 INFO L280 TraceCheckUtils]: 6: Hoare triple {45#true} havoc #t~nondet2; {45#true} is VALID [2020-07-08 15:54:53,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#true} assume !(~m~0 < 0 || ~m~0 > 1073741823); {45#true} is VALID [2020-07-08 15:54:53,920 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {45#true} is VALID [2020-07-08 15:54:53,921 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#true} ~n~0 := #t~nondet3; {45#true} is VALID [2020-07-08 15:54:53,921 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#true} havoc #t~nondet3; {45#true} is VALID [2020-07-08 15:54:53,922 INFO L280 TraceCheckUtils]: 11: Hoare triple {45#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {49#(<= 0 main_~n~0)} is VALID [2020-07-08 15:54:53,923 INFO L263 TraceCheckUtils]: 12: Hoare triple {49#(<= 0 main_~n~0)} call #t~ret4 := addition(~m~0, ~n~0); {45#true} is VALID [2020-07-08 15:54:53,924 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#true} ~m := #in~m; {58#(= |addition_#in~m| addition_~m)} is VALID [2020-07-08 15:54:53,925 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#(= |addition_#in~m| addition_~m)} ~n := #in~n; {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} is VALID [2020-07-08 15:54:53,926 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#(and (= |addition_#in~n| addition_~n) (= |addition_#in~m| addition_~m))} assume 0 == ~n; {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} is VALID [2020-07-08 15:54:53,928 INFO L280 TraceCheckUtils]: 16: Hoare triple {60#(and (= 0 |addition_#in~n|) (= |addition_#in~m| addition_~m))} #res := ~m; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-08 15:54:53,929 INFO L280 TraceCheckUtils]: 17: Hoare triple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} assume true; {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} is VALID [2020-07-08 15:54:53,931 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {61#(and (= 0 |addition_#in~n|) (= |addition_#in~m| |addition_#res|))} {49#(<= 0 main_~n~0)} #62#return; {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-08 15:54:53,932 INFO L280 TraceCheckUtils]: 19: Hoare triple {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} is VALID [2020-07-08 15:54:53,934 INFO L280 TraceCheckUtils]: 20: Hoare triple {56#(and (<= (+ |main_#t~ret4| main_~n~0) main_~m~0) (<= main_~m~0 (+ |main_#t~ret4| main_~n~0)))} ~result~0 := #t~ret4; {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} is VALID [2020-07-08 15:54:53,935 INFO L280 TraceCheckUtils]: 21: Hoare triple {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} havoc #t~ret4; {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} is VALID [2020-07-08 15:54:53,937 INFO L280 TraceCheckUtils]: 22: Hoare triple {57#(and (<= main_~m~0 (+ main_~result~0 main_~n~0)) (<= (+ main_~result~0 main_~n~0) main_~m~0))} assume !(~result~0 == ~m~0 - ~n~0); {46#false} is VALID [2020-07-08 15:54:53,937 INFO L280 TraceCheckUtils]: 23: Hoare triple {46#false} assume !false; {46#false} is VALID [2020-07-08 15:54:53,941 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-08 15:54:53,941 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:53,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565658382] [2020-07-08 15:54:53,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:53,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 15:54:53,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935321151] [2020-07-08 15:54:53,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-08 15:54:53,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:53,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 15:54:54,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:54,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 15:54:54,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:54,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 15:54:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-08 15:54:54,019 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 9 states. [2020-07-08 15:54:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:54,919 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-08 15:54:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 15:54:54,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-08 15:54:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 15:54:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2020-07-08 15:54:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 15:54:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2020-07-08 15:54:54,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2020-07-08 15:54:55,039 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-08 15:54:55,064 INFO L225 Difference]: With dead ends: 56 [2020-07-08 15:54:55,065 INFO L226 Difference]: Without dead ends: 37 [2020-07-08 15:54:55,077 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-08 15:54:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-08 15:54:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-08 15:54:55,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:55,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-08 15:54:55,169 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-08 15:54:55,169 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-08 15:54:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:55,176 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-08 15:54:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-08 15:54:55,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:55,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:55,178 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-08 15:54:55,178 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-08 15:54:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:55,183 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-08 15:54:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-08 15:54:55,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:55,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:55,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:55,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 15:54:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-08 15:54:55,191 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 24 [2020-07-08 15:54:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:55,192 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-08 15:54:55,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 15:54:55,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 42 transitions. [2020-07-08 15:54:55,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-08 15:54:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 15:54:55,271 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:55,272 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] [2020-07-08 15:54:55,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:54:55,273 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2135506668, now seen corresponding path program 1 times [2020-07-08 15:54:55,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:55,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1372286592] [2020-07-08 15:54:55,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:55,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {334#true} assume true; {334#true} is VALID [2020-07-08 15:54:55,315 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2020-07-08 15:54:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:55,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {334#true} ~m := #in~m; {334#true} is VALID [2020-07-08 15:54:55,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {334#true} ~n := #in~n; {346#(= |addition_#in~n| addition_~n)} is VALID [2020-07-08 15:54:55,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-08 15:54:55,413 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} assume !(~n > 0); {348#(and (= |addition_#in~n| addition_~n) (<= addition_~n 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-08 15:54:55,414 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#(and (= |addition_#in~n| addition_~n) (<= addition_~n 0) (not (= 0 |addition_#in~n|)))} assume !(~n < 0); {349#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-08 15:54:55,415 INFO L280 TraceCheckUtils]: 5: Hoare triple {349#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume true; {349#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-08 15:54:55,417 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {349#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} {338#(<= 0 main_~n~0)} #62#return; {335#false} is VALID [2020-07-08 15:54:55,417 INFO L263 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2020-07-08 15:54:55,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {334#true} assume true; {334#true} is VALID [2020-07-08 15:54:55,418 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2020-07-08 15:54:55,418 INFO L263 TraceCheckUtils]: 3: Hoare triple {334#true} call #t~ret5 := main(); {334#true} is VALID [2020-07-08 15:54:55,419 INFO L280 TraceCheckUtils]: 4: Hoare triple {334#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {334#true} is VALID [2020-07-08 15:54:55,419 INFO L280 TraceCheckUtils]: 5: Hoare triple {334#true} ~m~0 := #t~nondet2; {334#true} is VALID [2020-07-08 15:54:55,419 INFO L280 TraceCheckUtils]: 6: Hoare triple {334#true} havoc #t~nondet2; {334#true} is VALID [2020-07-08 15:54:55,419 INFO L280 TraceCheckUtils]: 7: Hoare triple {334#true} assume !(~m~0 < 0 || ~m~0 > 1073741823); {334#true} is VALID [2020-07-08 15:54:55,420 INFO L280 TraceCheckUtils]: 8: Hoare triple {334#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {334#true} is VALID [2020-07-08 15:54:55,420 INFO L280 TraceCheckUtils]: 9: Hoare triple {334#true} ~n~0 := #t~nondet3; {334#true} is VALID [2020-07-08 15:54:55,420 INFO L280 TraceCheckUtils]: 10: Hoare triple {334#true} havoc #t~nondet3; {334#true} is VALID [2020-07-08 15:54:55,426 INFO L280 TraceCheckUtils]: 11: Hoare triple {334#true} assume !(~n~0 < 0 || ~n~0 > 1073741823); {338#(<= 0 main_~n~0)} is VALID [2020-07-08 15:54:55,426 INFO L263 TraceCheckUtils]: 12: Hoare triple {338#(<= 0 main_~n~0)} call #t~ret4 := addition(~m~0, ~n~0); {334#true} is VALID [2020-07-08 15:54:55,427 INFO L280 TraceCheckUtils]: 13: Hoare triple {334#true} ~m := #in~m; {334#true} is VALID [2020-07-08 15:54:55,427 INFO L280 TraceCheckUtils]: 14: Hoare triple {334#true} ~n := #in~n; {346#(= |addition_#in~n| addition_~n)} is VALID [2020-07-08 15:54:55,428 INFO L280 TraceCheckUtils]: 15: Hoare triple {346#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-08 15:54:55,429 INFO L280 TraceCheckUtils]: 16: Hoare triple {347#(and (= |addition_#in~n| addition_~n) (not (= 0 |addition_#in~n|)))} assume !(~n > 0); {348#(and (= |addition_#in~n| addition_~n) (<= addition_~n 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-08 15:54:55,430 INFO L280 TraceCheckUtils]: 17: Hoare triple {348#(and (= |addition_#in~n| addition_~n) (<= addition_~n 0) (not (= 0 |addition_#in~n|)))} assume !(~n < 0); {349#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-08 15:54:55,431 INFO L280 TraceCheckUtils]: 18: Hoare triple {349#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} assume true; {349#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} is VALID [2020-07-08 15:54:55,432 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {349#(and (<= |addition_#in~n| 0) (not (= 0 |addition_#in~n|)))} {338#(<= 0 main_~n~0)} #62#return; {335#false} is VALID [2020-07-08 15:54:55,432 INFO L280 TraceCheckUtils]: 20: Hoare triple {335#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {335#false} is VALID [2020-07-08 15:54:55,433 INFO L280 TraceCheckUtils]: 21: Hoare triple {335#false} ~result~0 := #t~ret4; {335#false} is VALID [2020-07-08 15:54:55,433 INFO L280 TraceCheckUtils]: 22: Hoare triple {335#false} havoc #t~ret4; {335#false} is VALID [2020-07-08 15:54:55,433 INFO L280 TraceCheckUtils]: 23: Hoare triple {335#false} assume !(~result~0 == ~m~0 - ~n~0); {335#false} is VALID [2020-07-08 15:54:55,434 INFO L280 TraceCheckUtils]: 24: Hoare triple {335#false} assume !false; {335#false} is VALID [2020-07-08 15:54:55,437 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-08 15:54:55,437 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:55,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1372286592] [2020-07-08 15:54:55,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:55,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 15:54:55,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282034771] [2020-07-08 15:54:55,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-08 15:54:55,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:55,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 15:54:55,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:55,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 15:54:55,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:55,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 15:54:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-08 15:54:55,479 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 7 states. [2020-07-08 15:54:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:55,865 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-08 15:54:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 15:54:55,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-08 15:54:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:54:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2020-07-08 15:54:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:54:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2020-07-08 15:54:55,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2020-07-08 15:54:55,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:55,978 INFO L225 Difference]: With dead ends: 56 [2020-07-08 15:54:55,980 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 15:54:55,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-08 15:54:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 15:54:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-08 15:54:56,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:56,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-08 15:54:56,028 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 15:54:56,028 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 15:54:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:56,032 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-08 15:54:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 15:54:56,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:56,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:56,033 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 15:54:56,033 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 15:54:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:56,037 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-08 15:54:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 15:54:56,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:56,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:56,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:56,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 15:54:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-08 15:54:56,041 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-07-08 15:54:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:56,042 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-08 15:54:56,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 15:54:56,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-08 15:54:56,076 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-08 15:54:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 15:54:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 15:54:56,077 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:56,078 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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-08 15:54:56,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:54:56,078 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:56,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1044754306, now seen corresponding path program 1 times [2020-07-08 15:54:56,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:56,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820635320] [2020-07-08 15:54:56,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:56,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 15:54:56,102 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-08 15:54:56,109 INFO L168 Benchmark]: Toolchain (without parser) took 3658.25 ms. Allocated memory was 146.3 MB in the beginning and 245.4 MB in the end (delta: 99.1 MB). Free memory was 103.0 MB in the beginning and 116.9 MB in the end (delta: -13.9 MB). Peak memory consumption was 85.2 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:56,110 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 15:54:56,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.14 ms. Allocated memory is still 146.3 MB. Free memory was 102.8 MB in the beginning and 92.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:56,111 INFO L168 Benchmark]: Boogie Preprocessor took 138.94 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 92.9 MB in the beginning and 182.8 MB in the end (delta: -89.9 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:56,112 INFO L168 Benchmark]: RCFGBuilder took 440.04 ms. Allocated memory is still 203.9 MB. Free memory was 182.2 MB in the beginning and 161.1 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:56,113 INFO L168 Benchmark]: TraceAbstraction took 2771.43 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 160.5 MB in the beginning and 116.9 MB in the end (delta: 43.6 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. [2020-07-08 15:54:56,118 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.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 302.14 ms. Allocated memory is still 146.3 MB. Free memory was 102.8 MB in the beginning and 92.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.94 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 92.9 MB in the beginning and 182.8 MB in the end (delta: -89.9 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 440.04 ms. Allocated memory is still 203.9 MB. Free memory was 182.2 MB in the beginning and 161.1 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2771.43 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 160.5 MB in the beginning and 116.9 MB in the end (delta: 43.6 MB). Peak memory consumption was 85.0 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...