/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/fibo_2calls_4-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:39:38,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:39:38,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:39:38,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:39:38,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:39:38,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:39:38,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:39:38,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:39:38,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:39:38,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:39:38,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:39:38,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:39:38,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:39:38,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:39:38,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:39:38,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:39:38,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:39:38,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:39:38,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:39:38,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:39:38,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:39:38,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:39:38,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:39:38,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:39:38,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:39:38,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:39:38,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:39:38,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:39:38,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:39:38,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:39:38,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:39:38,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:39:38,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:39:38,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:39:38,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:39:38,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:39:38,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:39:38,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:39:38,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:39:38,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:39:38,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:39:38,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:39:38,429 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:39:38,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:39:38,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:39:38,432 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:39:38,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:39:38,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:39:38,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:39:38,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:39:38,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:39:38,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:39:38,434 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:39:38,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:39:38,434 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:39:38,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:39:38,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:39:38,435 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:39:38,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:39:38,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:39:38,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:39:38,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:39:38,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:39:38,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:39:38,437 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:39:38,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:39:38,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:39:38,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:39:38,868 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:39:38,869 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:39:38,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-11-07 00:39:38,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf9aa5352/e93f0a840e2f4f26b4985ae2495345af/FLAG7ac16aa13 [2020-11-07 00:39:39,781 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:39:39,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-11-07 00:39:39,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf9aa5352/e93f0a840e2f4f26b4985ae2495345af/FLAG7ac16aa13 [2020-11-07 00:39:40,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf9aa5352/e93f0a840e2f4f26b4985ae2495345af [2020-11-07 00:39:40,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:39:40,130 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:39:40,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:39:40,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:39:40,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:39:40,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:39:40" (1/1) ... [2020-11-07 00:39:40,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff699de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40, skipping insertion in model container [2020-11-07 00:39:40,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:39:40" (1/1) ... [2020-11-07 00:39:40,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:39:40,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:39:40,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:39:40,383 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:39:40,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:39:40,431 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:39:40,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40 WrapperNode [2020-11-07 00:39:40,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:39:40,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:39:40,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:39:40,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:39:40,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40" (1/1) ... [2020-11-07 00:39:40,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40" (1/1) ... [2020-11-07 00:39:40,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40" (1/1) ... [2020-11-07 00:39:40,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40" (1/1) ... [2020-11-07 00:39:40,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40" (1/1) ... [2020-11-07 00:39:40,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40" (1/1) ... [2020-11-07 00:39:40,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40" (1/1) ... [2020-11-07 00:39:40,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:39:40,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:39:40,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:39:40,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:39:40,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40" (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-11-07 00:39:40,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:39:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:39:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:39:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 00:39:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 00:39:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:39:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:39:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:39:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:39:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:39:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:39:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 00:39:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 00:39:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:39:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:39:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:39:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:39:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:39:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:39:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:39:40,882 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:39:40,883 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:39:40,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:39:40 BoogieIcfgContainer [2020-11-07 00:39:40,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:39:40,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:39:40,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:39:40,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:39:40,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:39:40" (1/3) ... [2020-11-07 00:39:40,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5ef036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:39:40, skipping insertion in model container [2020-11-07 00:39:40,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:40" (2/3) ... [2020-11-07 00:39:40,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5ef036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:39:40, skipping insertion in model container [2020-11-07 00:39:40,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:39:40" (3/3) ... [2020-11-07 00:39:40,896 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-2.c [2020-11-07 00:39:40,920 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:39:40,926 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:39:40,952 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:39:41,001 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:39:41,002 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:39:41,002 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:39:41,003 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:39:41,003 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:39:41,003 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:39:41,003 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:39:41,003 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:39:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 00:39:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:39:41,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:41,039 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:41,040 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:41,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 00:39:41,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:41,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1757663164] [2020-11-07 00:39:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:41,162 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:41,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:41,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:39:41,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1757663164] [2020-11-07 00:39:41,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:41,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:39:41,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726400545] [2020-11-07 00:39:41,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:39:41,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:41,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:39:41,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:39:41,548 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 00:39:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:42,073 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2020-11-07 00:39:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:39:42,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:39:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:42,086 INFO L225 Difference]: With dead ends: 74 [2020-11-07 00:39:42,086 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 00:39:42,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:39:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 00:39:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 00:39:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:39:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:39:42,152 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 00:39:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:42,152 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:39:42,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:39:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:39:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:39:42,155 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:42,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:42,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:39:42,156 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 00:39:42,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:42,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1729765393] [2020-11-07 00:39:42,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:42,162 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:39:42,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1729765393] [2020-11-07 00:39:42,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:42,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:39:42,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668973911] [2020-11-07 00:39:42,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:39:42,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:42,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:39:42,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:39:42,310 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 00:39:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:42,678 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 00:39:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:39:42,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:39:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:42,682 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:39:42,682 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:39:42,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:39:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:39:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:39:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:39:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:39:42,705 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 00:39:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:42,706 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:39:42,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:39:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:39:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:39:42,708 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:42,709 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:42,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:39:42,709 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 00:39:42,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:42,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [243220970] [2020-11-07 00:39:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:42,714 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:39:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:39:42,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [243220970] [2020-11-07 00:39:42,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:42,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:39:42,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632536220] [2020-11-07 00:39:42,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:39:42,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:42,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:39:42,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:39:42,868 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 00:39:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:43,244 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 00:39:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:39:43,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 00:39:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:43,247 INFO L225 Difference]: With dead ends: 92 [2020-11-07 00:39:43,247 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 00:39:43,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:39:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 00:39:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 00:39:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 00:39:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 00:39:43,265 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 00:39:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:43,266 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 00:39:43,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:39:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 00:39:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:39:43,268 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:43,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:43,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:39:43,269 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:43,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:43,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 00:39:43,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:43,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1933038095] [2020-11-07 00:39:43,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:43,272 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:43,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:43,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:43,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:43,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:39:43,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1933038095] [2020-11-07 00:39:43,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:43,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:39:43,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662096466] [2020-11-07 00:39:43,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:39:43,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:39:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:39:43,419 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 00:39:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:44,054 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 00:39:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:39:44,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 00:39:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:44,058 INFO L225 Difference]: With dead ends: 84 [2020-11-07 00:39:44,058 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:39:44,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:39:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:39:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 00:39:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 00:39:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 00:39:44,095 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 00:39:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:44,096 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 00:39:44,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:39:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 00:39:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 00:39:44,102 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:44,103 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:44,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:39:44,106 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:44,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 00:39:44,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:44,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2003425594] [2020-11-07 00:39:44,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:44,112 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:39:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 00:39:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:39:44,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2003425594] [2020-11-07 00:39:44,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:44,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:39:44,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980134324] [2020-11-07 00:39:44,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:39:44,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:39:44,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:39:44,291 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 00:39:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:44,700 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 00:39:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:39:44,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 00:39:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:44,703 INFO L225 Difference]: With dead ends: 140 [2020-11-07 00:39:44,703 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:39:44,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:39:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:39:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:39:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:39:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 00:39:44,727 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 00:39:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:44,728 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 00:39:44,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:39:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 00:39:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:39:44,731 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:44,731 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:44,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:39:44,731 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 00:39:44,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:44,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [473603916] [2020-11-07 00:39:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:44,736 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:39:44,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [473603916] [2020-11-07 00:39:44,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:44,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:39:44,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249065391] [2020-11-07 00:39:44,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:39:44,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:44,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:39:44,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:39:44,915 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 00:39:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:45,430 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 00:39:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:39:45,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 00:39:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:45,434 INFO L225 Difference]: With dead ends: 152 [2020-11-07 00:39:45,435 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 00:39:45,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:39:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 00:39:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 00:39:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 00:39:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 00:39:45,462 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 00:39:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:45,463 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 00:39:45,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:39:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 00:39:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:39:45,465 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:45,465 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:45,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:39:45,465 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 00:39:45,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:45,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [892994038] [2020-11-07 00:39:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:45,469 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:45,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:45,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:45,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:45,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:45,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:45,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:39:45,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [892994038] [2020-11-07 00:39:45,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:45,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:39:45,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961496547] [2020-11-07 00:39:45,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:39:45,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:45,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:39:45,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:39:45,625 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 00:39:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:46,440 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 00:39:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:39:46,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 00:39:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:46,445 INFO L225 Difference]: With dead ends: 128 [2020-11-07 00:39:46,445 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 00:39:46,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:39:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 00:39:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 00:39:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 00:39:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 00:39:46,483 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 00:39:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:46,484 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 00:39:46,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:39:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 00:39:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 00:39:46,486 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:46,487 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:46,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:39:46,487 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 00:39:46,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:46,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1744487633] [2020-11-07 00:39:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:46,491 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:46,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:46,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:46,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:46,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:46,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:46,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:46,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:46,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 00:39:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 00:39:46,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1744487633] [2020-11-07 00:39:46,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:46,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:39:46,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894802181] [2020-11-07 00:39:46,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:39:46,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:46,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:39:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:39:46,787 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 00:39:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:47,451 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 00:39:47,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:39:47,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 00:39:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:47,458 INFO L225 Difference]: With dead ends: 237 [2020-11-07 00:39:47,459 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 00:39:47,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:39:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 00:39:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 00:39:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 00:39:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 00:39:47,547 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 00:39:47,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:47,549 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 00:39:47,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:39:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 00:39:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 00:39:47,555 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:47,556 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:47,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:39:47,561 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:47,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 00:39:47,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:47,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [784146127] [2020-11-07 00:39:47,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:47,567 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:47,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:47,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:47,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:47,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:47,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:47,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:47,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:47,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:39:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:39:47,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [784146127] [2020-11-07 00:39:47,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:47,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:39:47,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221994611] [2020-11-07 00:39:47,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:39:47,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:47,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:39:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:39:47,848 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 11 states. [2020-11-07 00:39:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:48,724 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 00:39:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:39:48,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-11-07 00:39:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:48,728 INFO L225 Difference]: With dead ends: 267 [2020-11-07 00:39:48,728 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 00:39:48,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:39:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 00:39:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 00:39:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 00:39:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 00:39:48,766 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 00:39:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:48,766 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 00:39:48,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:39:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 00:39:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-07 00:39:48,769 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:48,769 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:48,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:39:48,770 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:48,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:48,771 INFO L82 PathProgramCache]: Analyzing trace with hash -443839068, now seen corresponding path program 2 times [2020-11-07 00:39:48,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:48,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1851671371] [2020-11-07 00:39:48,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:48,774 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:48,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:48,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:48,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:48,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:48,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:48,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:48,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:48,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:39:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:49,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:49,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:49,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:49,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 00:39:49,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1851671371] [2020-11-07 00:39:49,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:49,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:39:49,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009388532] [2020-11-07 00:39:49,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:39:49,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:49,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:39:49,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:39:49,104 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 13 states. [2020-11-07 00:39:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:50,678 INFO L93 Difference]: Finished difference Result 275 states and 430 transitions. [2020-11-07 00:39:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:39:50,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2020-11-07 00:39:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:50,684 INFO L225 Difference]: With dead ends: 275 [2020-11-07 00:39:50,684 INFO L226 Difference]: Without dead ends: 125 [2020-11-07 00:39:50,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:39:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-07 00:39:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2020-11-07 00:39:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 00:39:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2020-11-07 00:39:50,715 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 114 [2020-11-07 00:39:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:50,716 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2020-11-07 00:39:50,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:39:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2020-11-07 00:39:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-07 00:39:50,717 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:50,718 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:50,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:39:50,718 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:50,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:50,719 INFO L82 PathProgramCache]: Analyzing trace with hash 693727952, now seen corresponding path program 1 times [2020-11-07 00:39:50,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:50,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525455357] [2020-11-07 00:39:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:50,722 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:39:50,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:39:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:39:50,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:39:50,786 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:39:50,786 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:39:50,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:39:50,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:39:50 BoogieIcfgContainer [2020-11-07 00:39:50,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:39:50,813 INFO L168 Benchmark]: Toolchain (without parser) took 10687.36 ms. Allocated memory was 151.0 MB in the beginning and 278.9 MB in the end (delta: 127.9 MB). Free memory was 127.7 MB in the beginning and 108.5 MB in the end (delta: 19.2 MB). Peak memory consumption was 148.2 MB. Max. memory is 8.0 GB. [2020-11-07 00:39:50,814 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:39:50,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.52 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 117.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:39:50,815 INFO L168 Benchmark]: Boogie Preprocessor took 58.84 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 116.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:39:50,815 INFO L168 Benchmark]: RCFGBuilder took 389.81 ms. Allocated memory is still 151.0 MB. Free memory was 116.4 MB in the beginning and 133.3 MB in the end (delta: -16.8 MB). Peak memory consumption was 17.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:39:50,816 INFO L168 Benchmark]: TraceAbstraction took 9923.06 ms. Allocated memory was 151.0 MB in the beginning and 278.9 MB in the end (delta: 127.9 MB). Free memory was 132.7 MB in the beginning and 108.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 152.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:39:50,819 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 299.52 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 117.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.84 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 116.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 389.81 ms. Allocated memory is still 151.0 MB. Free memory was 116.4 MB in the beginning and 133.3 MB in the end (delta: -16.8 MB). Peak memory consumption was 17.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9923.06 ms. Allocated memory was 151.0 MB in the beginning and 278.9 MB in the end (delta: 127.9 MB). Free memory was 132.7 MB in the beginning and 108.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 152.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 4; [L39] CALL, EXPR fibo1(x) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND TRUE n == 1 [L23] return 1; [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND TRUE n < 1 [L21] return 0; [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND FALSE !(n < 1) [L12] COND TRUE n == 1 [L13] return 1; [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND TRUE n == 1 [L13] return 1; [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND TRUE n < 1 [L11] return 0; [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 3 [L41] CALL reach_error() [L4] __assert_fail("0", "fibo_2calls_4-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.7s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 506 SDtfs, 742 SDslu, 851 SDs, 0 SdLazy, 2349 SolverSat, 303 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 61 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...