/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/loop-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:39:47,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:39:47,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:39:48,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:39:48,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:39:48,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:39:48,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:39:48,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:39:48,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:39:48,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:39:48,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:39:48,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:39:48,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:39:48,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:39:48,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:39:48,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:39:48,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:39:48,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:39:48,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:39:48,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:39:48,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:39:48,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:39:48,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:39:48,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:39:48,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:39:48,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:39:48,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:39:48,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:39:48,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:39:48,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:39:48,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:39:48,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:39:48,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:39:48,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:39:48,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:39:48,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:39:48,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:39:48,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:39:48,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:39:48,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:39:48,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:39:48,065 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 17:39:48,075 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:39:48,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:39:48,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:39:48,077 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:39:48,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:39:48,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:39:48,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:39:48,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:39:48,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:39:48,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:39:48,078 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:39:48,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:39:48,078 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:39:48,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:39:48,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:39:48,079 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:39:48,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:39:48,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:39:48,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:39:48,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:39:48,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:39:48,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:39:48,080 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:39:48,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:39:48,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:39:48,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:39:48,405 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:39:48,406 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:39:48,406 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2020-07-08 17:39:48,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a8aae90a/eb7d62f571274332ac6b4dc45127df94/FLAGe410e9721 [2020-07-08 17:39:48,947 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:39:48,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2020-07-08 17:39:48,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a8aae90a/eb7d62f571274332ac6b4dc45127df94/FLAGe410e9721 [2020-07-08 17:39:49,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a8aae90a/eb7d62f571274332ac6b4dc45127df94 [2020-07-08 17:39:49,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:39:49,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:39:49,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:39:49,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:39:49,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:39:49,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:39:49" (1/1) ... [2020-07-08 17:39:49,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411860ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49, skipping insertion in model container [2020-07-08 17:39:49,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:39:49" (1/1) ... [2020-07-08 17:39:49,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:39:49,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:39:49,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:39:49,667 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:39:49,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:39:49,700 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:39:49,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49 WrapperNode [2020-07-08 17:39:49,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:39:49,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:39:49,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:39:49,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:39:49,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49" (1/1) ... [2020-07-08 17:39:49,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49" (1/1) ... [2020-07-08 17:39:49,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49" (1/1) ... [2020-07-08 17:39:49,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49" (1/1) ... [2020-07-08 17:39:49,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49" (1/1) ... [2020-07-08 17:39:49,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49" (1/1) ... [2020-07-08 17:39:49,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49" (1/1) ... [2020-07-08 17:39:49,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:39:49,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:39:49,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:39:49,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:39:49,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49" (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 17:39:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:39:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:39:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:39:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:39:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:39:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:39:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:39:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:39:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:39:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:39:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:39:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:39:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:39:50,198 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:39:50,199 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 17:39:50,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:39:50 BoogieIcfgContainer [2020-07-08 17:39:50,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:39:50,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:39:50,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:39:50,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:39:50,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:39:49" (1/3) ... [2020-07-08 17:39:50,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbc5bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:39:50, skipping insertion in model container [2020-07-08 17:39:50,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:49" (2/3) ... [2020-07-08 17:39:50,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbc5bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:39:50, skipping insertion in model container [2020-07-08 17:39:50,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:39:50" (3/3) ... [2020-07-08 17:39:50,213 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2020-07-08 17:39:50,225 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:39:50,233 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:39:50,250 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:39:50,274 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:39:50,275 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:39:50,275 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:39:50,275 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:39:50,275 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:39:50,276 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:39:50,276 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:39:50,276 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:39:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-08 17:39:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 17:39:50,303 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:50,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:50,305 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1007675669, now seen corresponding path program 1 times [2020-07-08 17:39:50,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:50,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565541929] [2020-07-08 17:39:50,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:50,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-08 17:39:50,517 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #57#return; {32#true} is VALID [2020-07-08 17:39:50,519 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-08 17:39:50,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-08 17:39:50,522 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #57#return; {32#true} is VALID [2020-07-08 17:39:50,523 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2020-07-08 17:39:50,523 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} ~x~0 := 0; {32#true} is VALID [2020-07-08 17:39:50,524 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} ~m~0 := 0; {32#true} is VALID [2020-07-08 17:39:50,524 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {32#true} is VALID [2020-07-08 17:39:50,525 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~n~0 := #t~nondet0; {32#true} is VALID [2020-07-08 17:39:50,525 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} havoc #t~nondet0; {32#true} is VALID [2020-07-08 17:39:50,529 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-08 17:39:50,529 INFO L263 TraceCheckUtils]: 10: Hoare triple {33#false} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {33#false} is VALID [2020-07-08 17:39:50,530 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-08 17:39:50,530 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-08 17:39:50,530 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-08 17:39:50,532 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 17:39:50,532 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:50,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565541929] [2020-07-08 17:39:50,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:50,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 17:39:50,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133147461] [2020-07-08 17:39:50,548 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-08 17:39:50,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:50,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 17:39:50,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:50,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 17:39:50,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 17:39:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 17:39:50,621 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-08 17:39:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:50,732 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-08 17:39:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 17:39:50,732 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-08 17:39:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 17:39:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-08 17:39:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 17:39:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-08 17:39:50,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2020-07-08 17:39:50,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:50,866 INFO L225 Difference]: With dead ends: 42 [2020-07-08 17:39:50,866 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 17:39:50,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 17:39:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 17:39:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-08 17:39:50,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:50,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-08 17:39:50,935 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 17:39:50,935 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 17:39:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:50,941 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-08 17:39:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-08 17:39:50,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:50,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:50,942 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 17:39:50,942 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 17:39:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:50,947 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-08 17:39:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-08 17:39:50,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:50,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:50,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:50,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 17:39:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-08 17:39:50,953 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2020-07-08 17:39:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:50,954 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-08 17:39:50,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 17:39:50,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2020-07-08 17:39:51,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-08 17:39:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 17:39:51,001 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:51,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:51,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:39:51,003 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash 993822854, now seen corresponding path program 1 times [2020-07-08 17:39:51,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:51,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1706600985] [2020-07-08 17:39:51,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:51,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-08 17:39:51,119 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {218#true} {218#true} #57#return; {218#true} is VALID [2020-07-08 17:39:51,119 INFO L263 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2020-07-08 17:39:51,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-08 17:39:51,120 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #57#return; {218#true} is VALID [2020-07-08 17:39:51,121 INFO L263 TraceCheckUtils]: 3: Hoare triple {218#true} call #t~ret2 := main(); {218#true} is VALID [2020-07-08 17:39:51,121 INFO L280 TraceCheckUtils]: 4: Hoare triple {218#true} ~x~0 := 0; {218#true} is VALID [2020-07-08 17:39:51,124 INFO L280 TraceCheckUtils]: 5: Hoare triple {218#true} ~m~0 := 0; {222#(<= 0 main_~m~0)} is VALID [2020-07-08 17:39:51,125 INFO L280 TraceCheckUtils]: 6: Hoare triple {222#(<= 0 main_~m~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {222#(<= 0 main_~m~0)} is VALID [2020-07-08 17:39:51,126 INFO L280 TraceCheckUtils]: 7: Hoare triple {222#(<= 0 main_~m~0)} ~n~0 := #t~nondet0; {222#(<= 0 main_~m~0)} is VALID [2020-07-08 17:39:51,127 INFO L280 TraceCheckUtils]: 8: Hoare triple {222#(<= 0 main_~m~0)} havoc #t~nondet0; {222#(<= 0 main_~m~0)} is VALID [2020-07-08 17:39:51,128 INFO L280 TraceCheckUtils]: 9: Hoare triple {222#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {222#(<= 0 main_~m~0)} is VALID [2020-07-08 17:39:51,130 INFO L263 TraceCheckUtils]: 10: Hoare triple {222#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {223#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:51,132 INFO L280 TraceCheckUtils]: 11: Hoare triple {223#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {224#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:51,133 INFO L280 TraceCheckUtils]: 12: Hoare triple {224#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {219#false} is VALID [2020-07-08 17:39:51,134 INFO L280 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2020-07-08 17:39:51,136 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 17:39:51,136 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:51,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1706600985] [2020-07-08 17:39:51,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:51,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:39:51,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922210896] [2020-07-08 17:39:51,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-08 17:39:51,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:51,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:39:51,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:51,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:39:51,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:51,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:39:51,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:39:51,165 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2020-07-08 17:39:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:51,369 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-08 17:39:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:39:51,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-08 17:39:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:39:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-08 17:39:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:39:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-08 17:39:51,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2020-07-08 17:39:51,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:51,440 INFO L225 Difference]: With dead ends: 39 [2020-07-08 17:39:51,440 INFO L226 Difference]: Without dead ends: 37 [2020-07-08 17:39:51,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 17:39:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-08 17:39:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-08 17:39:51,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:51,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2020-07-08 17:39:51,479 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2020-07-08 17:39:51,479 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2020-07-08 17:39:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:51,483 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-08 17:39:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-08 17:39:51,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:51,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:51,485 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2020-07-08 17:39:51,485 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2020-07-08 17:39:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:51,489 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-08 17:39:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-08 17:39:51,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:51,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:51,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:51,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 17:39:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-08 17:39:51,494 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2020-07-08 17:39:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:51,494 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-08 17:39:51,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:39:51,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2020-07-08 17:39:51,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-08 17:39:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 17:39:51,545 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:51,545 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:51,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:39:51,546 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1988212296, now seen corresponding path program 1 times [2020-07-08 17:39:51,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:51,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1588525791] [2020-07-08 17:39:51,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:51,655 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-08 17:39:51,655 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {449#true} {449#true} #57#return; {449#true} is VALID [2020-07-08 17:39:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:51,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-08 17:39:51,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-08 17:39:51,667 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-08 17:39:51,668 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {449#true} {454#(<= main_~n~0 0)} #61#return; {454#(<= main_~n~0 0)} is VALID [2020-07-08 17:39:51,668 INFO L263 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2020-07-08 17:39:51,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-08 17:39:51,669 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {449#true} {449#true} #57#return; {449#true} is VALID [2020-07-08 17:39:51,669 INFO L263 TraceCheckUtils]: 3: Hoare triple {449#true} call #t~ret2 := main(); {449#true} is VALID [2020-07-08 17:39:51,670 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} ~x~0 := 0; {453#(<= main_~x~0 0)} is VALID [2020-07-08 17:39:51,671 INFO L280 TraceCheckUtils]: 5: Hoare triple {453#(<= main_~x~0 0)} ~m~0 := 0; {453#(<= main_~x~0 0)} is VALID [2020-07-08 17:39:51,672 INFO L280 TraceCheckUtils]: 6: Hoare triple {453#(<= main_~x~0 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {453#(<= main_~x~0 0)} is VALID [2020-07-08 17:39:51,673 INFO L280 TraceCheckUtils]: 7: Hoare triple {453#(<= main_~x~0 0)} ~n~0 := #t~nondet0; {453#(<= main_~x~0 0)} is VALID [2020-07-08 17:39:51,674 INFO L280 TraceCheckUtils]: 8: Hoare triple {453#(<= main_~x~0 0)} havoc #t~nondet0; {453#(<= main_~x~0 0)} is VALID [2020-07-08 17:39:51,675 INFO L280 TraceCheckUtils]: 9: Hoare triple {453#(<= main_~x~0 0)} assume !(~x~0 < ~n~0); {454#(<= main_~n~0 0)} is VALID [2020-07-08 17:39:51,675 INFO L263 TraceCheckUtils]: 10: Hoare triple {454#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {449#true} is VALID [2020-07-08 17:39:51,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-08 17:39:51,676 INFO L280 TraceCheckUtils]: 12: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-08 17:39:51,676 INFO L280 TraceCheckUtils]: 13: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-08 17:39:51,677 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {449#true} {454#(<= main_~n~0 0)} #61#return; {454#(<= main_~n~0 0)} is VALID [2020-07-08 17:39:51,679 INFO L263 TraceCheckUtils]: 15: Hoare triple {454#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {459#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:51,680 INFO L280 TraceCheckUtils]: 16: Hoare triple {459#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {460#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:51,681 INFO L280 TraceCheckUtils]: 17: Hoare triple {460#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {450#false} is VALID [2020-07-08 17:39:51,682 INFO L280 TraceCheckUtils]: 18: Hoare triple {450#false} assume !false; {450#false} is VALID [2020-07-08 17:39:51,683 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 17:39:51,683 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:51,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1588525791] [2020-07-08 17:39:51,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:51,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 17:39:51,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776825474] [2020-07-08 17:39:51,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-08 17:39:51,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:51,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 17:39:51,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:51,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 17:39:51,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:51,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 17:39:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:39:51,712 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2020-07-08 17:39:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:51,972 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-07-08 17:39:51,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 17:39:51,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-08 17:39:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:39:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-08 17:39:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:39:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-08 17:39:51,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2020-07-08 17:39:52,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:52,042 INFO L225 Difference]: With dead ends: 54 [2020-07-08 17:39:52,042 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 17:39:52,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:39:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 17:39:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-07-08 17:39:52,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:52,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 35 states. [2020-07-08 17:39:52,086 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 35 states. [2020-07-08 17:39:52,086 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 35 states. [2020-07-08 17:39:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:52,090 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-08 17:39:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-08 17:39:52,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:52,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:52,091 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 42 states. [2020-07-08 17:39:52,091 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 42 states. [2020-07-08 17:39:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:52,095 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-08 17:39:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-08 17:39:52,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:52,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:52,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:52,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 17:39:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-08 17:39:52,100 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2020-07-08 17:39:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:52,100 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-08 17:39:52,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 17:39:52,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-08 17:39:52,157 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 17:39:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 17:39:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 17:39:52,158 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:52,159 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] [2020-07-08 17:39:52,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:39:52,159 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:52,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2096508511, now seen corresponding path program 1 times [2020-07-08 17:39:52,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:52,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1807544992] [2020-07-08 17:39:52,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:52,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {729#true} assume true; {729#true} is VALID [2020-07-08 17:39:52,263 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {729#true} {729#true} #57#return; {729#true} is VALID [2020-07-08 17:39:52,263 INFO L263 TraceCheckUtils]: 0: Hoare triple {729#true} call ULTIMATE.init(); {729#true} is VALID [2020-07-08 17:39:52,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {729#true} assume true; {729#true} is VALID [2020-07-08 17:39:52,264 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {729#true} {729#true} #57#return; {729#true} is VALID [2020-07-08 17:39:52,264 INFO L263 TraceCheckUtils]: 3: Hoare triple {729#true} call #t~ret2 := main(); {729#true} is VALID [2020-07-08 17:39:52,265 INFO L280 TraceCheckUtils]: 4: Hoare triple {729#true} ~x~0 := 0; {733#(<= 0 main_~x~0)} is VALID [2020-07-08 17:39:52,266 INFO L280 TraceCheckUtils]: 5: Hoare triple {733#(<= 0 main_~x~0)} ~m~0 := 0; {733#(<= 0 main_~x~0)} is VALID [2020-07-08 17:39:52,267 INFO L280 TraceCheckUtils]: 6: Hoare triple {733#(<= 0 main_~x~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {733#(<= 0 main_~x~0)} is VALID [2020-07-08 17:39:52,267 INFO L280 TraceCheckUtils]: 7: Hoare triple {733#(<= 0 main_~x~0)} ~n~0 := #t~nondet0; {733#(<= 0 main_~x~0)} is VALID [2020-07-08 17:39:52,268 INFO L280 TraceCheckUtils]: 8: Hoare triple {733#(<= 0 main_~x~0)} havoc #t~nondet0; {733#(<= 0 main_~x~0)} is VALID [2020-07-08 17:39:52,269 INFO L280 TraceCheckUtils]: 9: Hoare triple {733#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0); {733#(<= 0 main_~x~0)} is VALID [2020-07-08 17:39:52,270 INFO L280 TraceCheckUtils]: 10: Hoare triple {733#(<= 0 main_~x~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {733#(<= 0 main_~x~0)} is VALID [2020-07-08 17:39:52,270 INFO L280 TraceCheckUtils]: 11: Hoare triple {733#(<= 0 main_~x~0)} assume 0 != #t~nondet1; {733#(<= 0 main_~x~0)} is VALID [2020-07-08 17:39:52,271 INFO L280 TraceCheckUtils]: 12: Hoare triple {733#(<= 0 main_~x~0)} havoc #t~nondet1; {733#(<= 0 main_~x~0)} is VALID [2020-07-08 17:39:52,272 INFO L280 TraceCheckUtils]: 13: Hoare triple {733#(<= 0 main_~x~0)} ~m~0 := ~x~0; {734#(<= 0 main_~m~0)} is VALID [2020-07-08 17:39:52,273 INFO L280 TraceCheckUtils]: 14: Hoare triple {734#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {734#(<= 0 main_~m~0)} is VALID [2020-07-08 17:39:52,274 INFO L280 TraceCheckUtils]: 15: Hoare triple {734#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {734#(<= 0 main_~m~0)} is VALID [2020-07-08 17:39:52,275 INFO L263 TraceCheckUtils]: 16: Hoare triple {734#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {735#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:52,276 INFO L280 TraceCheckUtils]: 17: Hoare triple {735#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {736#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:52,277 INFO L280 TraceCheckUtils]: 18: Hoare triple {736#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {730#false} is VALID [2020-07-08 17:39:52,278 INFO L280 TraceCheckUtils]: 19: Hoare triple {730#false} assume !false; {730#false} is VALID [2020-07-08 17:39:52,279 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 17:39:52,279 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:52,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1807544992] [2020-07-08 17:39:52,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:52,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 17:39:52,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652498660] [2020-07-08 17:39:52,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-08 17:39:52,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:52,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 17:39:52,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:52,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 17:39:52,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:52,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 17:39:52,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:39:52,306 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2020-07-08 17:39:52,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:52,511 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2020-07-08 17:39:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 17:39:52,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-08 17:39:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:39:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-08 17:39:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:39:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-08 17:39:52,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2020-07-08 17:39:52,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:52,552 INFO L225 Difference]: With dead ends: 41 [2020-07-08 17:39:52,552 INFO L226 Difference]: Without dead ends: 37 [2020-07-08 17:39:52,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:39:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-08 17:39:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2020-07-08 17:39:52,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:52,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 27 states. [2020-07-08 17:39:52,588 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 27 states. [2020-07-08 17:39:52,588 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 27 states. [2020-07-08 17:39:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:52,591 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-08 17:39:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-08 17:39:52,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:52,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:52,592 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 37 states. [2020-07-08 17:39:52,592 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 37 states. [2020-07-08 17:39:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:52,595 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-08 17:39:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-08 17:39:52,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:52,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:52,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:52,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 17:39:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-08 17:39:52,598 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2020-07-08 17:39:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:52,599 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-08 17:39:52,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 17:39:52,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2020-07-08 17:39:52,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-08 17:39:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 17:39:52,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:52,634 INFO L422 BasicCegarLoop]: trace histogram [2, 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 17:39:52,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 17:39:52,634 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:52,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:52,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1883436929, now seen corresponding path program 1 times [2020-07-08 17:39:52,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:52,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1456481731] [2020-07-08 17:39:52,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:52,646 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 17:39:52,646 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 17:39:52,653 INFO L168 Benchmark]: Toolchain (without parser) took 3290.67 ms. Allocated memory was 143.1 MB in the beginning and 250.1 MB in the end (delta: 107.0 MB). Free memory was 100.1 MB in the beginning and 158.5 MB in the end (delta: -58.4 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:52,654 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 143.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 17:39:52,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.15 ms. Allocated memory is still 143.1 MB. Free memory was 99.7 MB in the beginning and 90.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:52,655 INFO L168 Benchmark]: Boogie Preprocessor took 121.84 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 90.0 MB in the beginning and 180.3 MB in the end (delta: -90.3 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:52,656 INFO L168 Benchmark]: RCFGBuilder took 377.27 ms. Allocated memory is still 200.3 MB. Free memory was 179.4 MB in the beginning and 161.5 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:52,657 INFO L168 Benchmark]: TraceAbstraction took 2444.20 ms. Allocated memory was 200.3 MB in the beginning and 250.1 MB in the end (delta: 49.8 MB). Free memory was 160.8 MB in the beginning and 158.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:52,662 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.27 ms. Allocated memory is still 143.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 337.15 ms. Allocated memory is still 143.1 MB. Free memory was 99.7 MB in the beginning and 90.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.84 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 90.0 MB in the beginning and 180.3 MB in the end (delta: -90.3 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 377.27 ms. Allocated memory is still 200.3 MB. Free memory was 179.4 MB in the beginning and 161.5 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2444.20 ms. Allocated memory was 200.3 MB in the beginning and 250.1 MB in the end (delta: 49.8 MB). Free memory was 160.8 MB in the beginning and 158.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 52.1 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...