/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-simple/id2_i5_o5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 15:57:03,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:57:03,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:57:03,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:57:03,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:57:03,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:57:03,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:57:03,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:57:03,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:57:03,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:57:03,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:57:03,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:57:03,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:57:03,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:57:03,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:57:03,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:57:03,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:57:03,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:57:03,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:57:03,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:57:03,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:57:03,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:57:03,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:57:03,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:57:03,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:57:03,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:57:03,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:57:03,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:57:03,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:57:03,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:57:03,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:57:03,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:57:03,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:57:03,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:57:03,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:57:03,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:57:03,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:57:03,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:57:03,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:57:03,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:57:03,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:57:03,301 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:57:03,309 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:57:03,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:57:03,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:57:03,311 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:57:03,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:57:03,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:57:03,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:57:03,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:57:03,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:57:03,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:57:03,312 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:57:03,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:57:03,312 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:57:03,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:57:03,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:57:03,313 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:57:03,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:57:03,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:57:03,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:57:03,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:57:03,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:57:03,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:57:03,314 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:57:03,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:57:03,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:57:03,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:57:03,586 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:57:03,586 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:57:03,587 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-08 15:57:03,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/002e7ae8b/34cd62a6a8ea4e639bdf04148e6749cc/FLAG296aeefd1 [2020-07-08 15:57:04,097 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:57:04,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-08 15:57:04,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/002e7ae8b/34cd62a6a8ea4e639bdf04148e6749cc/FLAG296aeefd1 [2020-07-08 15:57:04,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/002e7ae8b/34cd62a6a8ea4e639bdf04148e6749cc [2020-07-08 15:57:04,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:57:04,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:57:04,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:57:04,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:57:04,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:57:04,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:57:04" (1/1) ... [2020-07-08 15:57:04,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463ccf06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04, skipping insertion in model container [2020-07-08 15:57:04,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:57:04" (1/1) ... [2020-07-08 15:57:04,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:57:04,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:57:04,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:57:04,721 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:57:04,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:57:04,752 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:57:04,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04 WrapperNode [2020-07-08 15:57:04,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:57:04,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:57:04,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:57:04,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:57:04,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04" (1/1) ... [2020-07-08 15:57:04,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04" (1/1) ... [2020-07-08 15:57:04,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04" (1/1) ... [2020-07-08 15:57:04,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04" (1/1) ... [2020-07-08 15:57:04,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04" (1/1) ... [2020-07-08 15:57:04,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04" (1/1) ... [2020-07-08 15:57:04,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04" (1/1) ... [2020-07-08 15:57:04,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:57:04,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:57:04,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:57:04,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:57:04,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04" (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:57:04,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:57:04,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:57:04,924 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-08 15:57:04,924 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-07-08 15:57:04,924 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:57:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 15:57:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:57:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-08 15:57:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-07-08 15:57:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:57:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:57:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:57:05,167 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:57:05,167 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 15:57:05,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:57:05 BoogieIcfgContainer [2020-07-08 15:57:05,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:57:05,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:57:05,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:57:05,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:57:05,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:57:04" (1/3) ... [2020-07-08 15:57:05,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2c89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:57:05, skipping insertion in model container [2020-07-08 15:57:05,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:04" (2/3) ... [2020-07-08 15:57:05,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2c89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:57:05, skipping insertion in model container [2020-07-08 15:57:05,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:57:05" (3/3) ... [2020-07-08 15:57:05,183 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2020-07-08 15:57:05,194 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:57:05,202 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:57:05,218 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:57:05,241 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:57:05,242 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:57:05,242 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:57:05,242 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:57:05,242 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:57:05,243 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:57:05,243 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:57:05,243 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:57:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-08 15:57:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 15:57:05,285 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:57:05,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:57:05,286 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:57:05,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:57:05,292 INFO L82 PathProgramCache]: Analyzing trace with hash -588914908, now seen corresponding path program 1 times [2020-07-08 15:57:05,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:57:05,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [217657454] [2020-07-08 15:57:05,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:57:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:05,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 15:57:05,475 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-08 15:57:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:05,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-08 15:57:05,526 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 15:57:05,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 15:57:05,533 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 15:57:05,535 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-08 15:57:05,536 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2020-07-08 15:57:05,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 15:57:05,537 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-08 15:57:05,537 INFO L263 TraceCheckUtils]: 3: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2020-07-08 15:57:05,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {37#true} ~input~0 := 5; {41#(<= 5 main_~input~0)} is VALID [2020-07-08 15:57:05,540 INFO L263 TraceCheckUtils]: 5: Hoare triple {41#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {37#true} is VALID [2020-07-08 15:57:05,541 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-08 15:57:05,542 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 15:57:05,544 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 15:57:05,545 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 15:57:05,547 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-08 15:57:05,547 INFO L280 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {38#false} is VALID [2020-07-08 15:57:05,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} ~result~0 := #t~ret2; {38#false} is VALID [2020-07-08 15:57:05,548 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} havoc #t~ret2; {38#false} is VALID [2020-07-08 15:57:05,549 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} assume 5 == ~result~0; {38#false} is VALID [2020-07-08 15:57:05,549 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-08 15:57:05,554 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:57:05,554 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:57:05,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [217657454] [2020-07-08 15:57:05,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:57:05,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 15:57:05,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729379378] [2020-07-08 15:57:05,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 15:57:05,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:57:05,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 15:57:05,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:57:05,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 15:57:05,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:57:05,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 15:57:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 15:57:05,630 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-07-08 15:57:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:05,956 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-08 15:57:05,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 15:57:05,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 15:57:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:57:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 15:57:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-08 15:57:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 15:57:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-08 15:57:05,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-08 15:57:06,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:57:06,072 INFO L225 Difference]: With dead ends: 46 [2020-07-08 15:57:06,073 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 15:57:06,077 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 15:57:06,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 15:57:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-08 15:57:06,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:57:06,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-08 15:57:06,172 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 15:57:06,172 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 15:57:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:06,178 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-08 15:57:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 15:57:06,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:57:06,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:57:06,181 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 15:57:06,181 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 15:57:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:06,189 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-08 15:57:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 15:57:06,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:57:06,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:57:06,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:57:06,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:57:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 15:57:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-08 15:57:06,199 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 16 [2020-07-08 15:57:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:57:06,200 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-08 15:57:06,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 15:57:06,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-08 15:57:06,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:57:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 15:57:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 15:57:06,262 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:57:06,264 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:57:06,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:57:06,265 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:57:06,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:57:06,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1852809946, now seen corresponding path program 1 times [2020-07-08 15:57:06,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:57:06,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1050238078] [2020-07-08 15:57:06,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:57:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:06,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-08 15:57:06,355 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-08 15:57:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:06,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 15:57:06,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 15:57:06,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 15:57:06,480 INFO L280 TraceCheckUtils]: 3: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 15:57:06,482 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-08 15:57:06,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#(= |id_#in~x| id_~x)} assume !(0 == ~x); {291#(= |id_#in~x| id_~x)} is VALID [2020-07-08 15:57:06,488 INFO L263 TraceCheckUtils]: 2: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-08 15:57:06,489 INFO L280 TraceCheckUtils]: 3: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 15:57:06,490 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 15:57:06,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 15:57:06,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 15:57:06,493 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {297#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,495 INFO L280 TraceCheckUtils]: 9: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,495 INFO L280 TraceCheckUtils]: 10: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,496 INFO L280 TraceCheckUtils]: 11: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,497 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-08 15:57:06,499 INFO L263 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2020-07-08 15:57:06,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-08 15:57:06,499 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-08 15:57:06,500 INFO L263 TraceCheckUtils]: 3: Hoare triple {273#true} call #t~ret3 := main(); {273#true} is VALID [2020-07-08 15:57:06,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {273#true} ~input~0 := 5; {277#(<= 5 main_~input~0)} is VALID [2020-07-08 15:57:06,502 INFO L263 TraceCheckUtils]: 5: Hoare triple {277#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {273#true} is VALID [2020-07-08 15:57:06,504 INFO L280 TraceCheckUtils]: 6: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-08 15:57:06,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {291#(= |id_#in~x| id_~x)} assume !(0 == ~x); {291#(= |id_#in~x| id_~x)} is VALID [2020-07-08 15:57:06,509 INFO L263 TraceCheckUtils]: 8: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-08 15:57:06,510 INFO L280 TraceCheckUtils]: 9: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 15:57:06,511 INFO L280 TraceCheckUtils]: 10: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 15:57:06,512 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 15:57:06,512 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 15:57:06,514 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,515 INFO L280 TraceCheckUtils]: 14: Hoare triple {297#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,516 INFO L280 TraceCheckUtils]: 15: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,516 INFO L280 TraceCheckUtils]: 16: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,517 INFO L280 TraceCheckUtils]: 17: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 15:57:06,519 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-08 15:57:06,520 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {274#false} is VALID [2020-07-08 15:57:06,520 INFO L280 TraceCheckUtils]: 20: Hoare triple {274#false} ~result~0 := #t~ret2; {274#false} is VALID [2020-07-08 15:57:06,520 INFO L280 TraceCheckUtils]: 21: Hoare triple {274#false} havoc #t~ret2; {274#false} is VALID [2020-07-08 15:57:06,521 INFO L280 TraceCheckUtils]: 22: Hoare triple {274#false} assume 5 == ~result~0; {274#false} is VALID [2020-07-08 15:57:06,521 INFO L280 TraceCheckUtils]: 23: Hoare triple {274#false} assume !false; {274#false} is VALID [2020-07-08 15:57:06,525 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:57:06,526 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:57:06,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1050238078] [2020-07-08 15:57:06,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:57:06,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 15:57:06,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201741849] [2020-07-08 15:57:06,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 15:57:06,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:57:06,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 15:57:06,562 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:57:06,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 15:57:06,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:57:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 15:57:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 15:57:06,563 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2020-07-08 15:57:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:06,851 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-08 15:57:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 15:57:06,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 15:57:06,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:57:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:57:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-08 15:57:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:57:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-08 15:57:06,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2020-07-08 15:57:06,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:57:06,920 INFO L225 Difference]: With dead ends: 45 [2020-07-08 15:57:06,920 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 15:57:06,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-08 15:57:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 15:57:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-08 15:57:06,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:57:06,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-08 15:57:06,969 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-08 15:57:06,969 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-08 15:57:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:06,973 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 15:57:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 15:57:06,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:57:06,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:57:06,974 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-08 15:57:06,975 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-08 15:57:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:06,979 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 15:57:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 15:57:06,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:57:06,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:57:06,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:57:06,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:57:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 15:57:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-08 15:57:06,984 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2020-07-08 15:57:06,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:57:06,984 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-08 15:57:06,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 15:57:06,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2020-07-08 15:57:07,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:57:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-08 15:57:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 15:57:07,040 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:57:07,040 INFO L422 BasicCegarLoop]: trace histogram [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:57:07,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:57:07,041 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:57:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:57:07,041 INFO L82 PathProgramCache]: Analyzing trace with hash -238705980, now seen corresponding path program 1 times [2020-07-08 15:57:07,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:57:07,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195216249] [2020-07-08 15:57:07,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 [2020-07-08 15:57:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:07,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} assume true; {548#true} is VALID [2020-07-08 15:57:07,246 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {548#true} {548#true} #44#return; {548#true} is VALID [2020-07-08 15:57:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 15:57:07,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 15:57:07,257 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: has to be unsat by construction, we do check only for interpolant computation at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:396) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:239) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:108) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:279) 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:57:07,263 INFO L168 Benchmark]: Toolchain (without parser) took 2735.61 ms. Allocated memory was 145.2 MB in the beginning and 244.3 MB in the end (delta: 99.1 MB). Free memory was 103.8 MB in the beginning and 207.1 MB in the end (delta: -103.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 15:57:07,264 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 15:57:07,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.13 ms. Allocated memory is still 145.2 MB. Free memory was 103.3 MB in the beginning and 93.4 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:57:07,266 INFO L168 Benchmark]: Boogie Preprocessor took 117.47 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 93.4 MB in the beginning and 182.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-08 15:57:07,267 INFO L168 Benchmark]: RCFGBuilder took 300.63 ms. Allocated memory is still 203.4 MB. Free memory was 182.7 MB in the beginning and 164.8 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2020-07-08 15:57:07,268 INFO L168 Benchmark]: TraceAbstraction took 2085.89 ms. Allocated memory was 203.4 MB in the beginning and 244.3 MB in the end (delta: 40.9 MB). Free memory was 164.2 MB in the beginning and 207.1 MB in the end (delta: -42.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 15:57:07,276 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.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 225.13 ms. Allocated memory is still 145.2 MB. Free memory was 103.3 MB in the beginning and 93.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.47 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 93.4 MB in the beginning and 182.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 300.63 ms. Allocated memory is still 203.4 MB. Free memory was 182.7 MB in the beginning and 164.8 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2085.89 ms. Allocated memory was 203.4 MB in the beginning and 244.3 MB in the end (delta: 40.9 MB). Free memory was 164.2 MB in the beginning and 207.1 MB in the end (delta: -42.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: has to be unsat by construction, we do check only for interpolant computation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: has to be unsat by construction, we do check only for interpolant computation: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:396) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...