/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:53:50,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:53:50,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:53:50,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:53:50,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:53:50,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:53:50,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:53:50,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:53:50,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:53:50,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:53:50,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:53:50,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:53:50,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:53:50,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:53:50,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:53:50,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:53:50,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:53:50,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:53:50,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:53:50,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:53:50,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:53:50,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:53:50,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:53:50,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:53:50,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:53:50,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:53:50,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:53:50,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:53:50,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:53:50,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:53:50,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:53:50,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:53:50,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:53:50,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:53:50,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:53:50,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:53:50,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:53:50,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:53:50,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:53:50,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:53:50,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:53:50,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:53:50,434 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:53:50,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:53:50,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:53:50,440 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:53:50,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:53:50,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:53:50,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:53:50,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:53:50,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:53:50,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:53:50,442 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:53:50,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:53:50,443 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:53:50,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:53:50,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:53:50,444 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:53:50,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:53:50,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:53:50,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:53:50,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:53:50,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:53:50,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:53:50,446 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:53:50,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:53:50,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:53:50,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:53:50,888 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:53:50,889 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:53:50,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-10-24 00:53:50,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e2f5623a/1eed90c2238b40988d7e7a5e277a896b/FLAG366178785 [2020-10-24 00:53:51,551 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:53:51,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-10-24 00:53:51,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e2f5623a/1eed90c2238b40988d7e7a5e277a896b/FLAG366178785 [2020-10-24 00:53:51,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e2f5623a/1eed90c2238b40988d7e7a5e277a896b [2020-10-24 00:53:51,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:53:51,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:53:51,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:53:51,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:53:51,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:53:51,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:53:51" (1/1) ... [2020-10-24 00:53:51,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723f04c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:51, skipping insertion in model container [2020-10-24 00:53:51,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:53:51" (1/1) ... [2020-10-24 00:53:51,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:53:51,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:53:52,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:53:52,173 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:53:52,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:53:52,206 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:53:52,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:52 WrapperNode [2020-10-24 00:53:52,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:53:52,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:53:52,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:53:52,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:53:52,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:52" (1/1) ... [2020-10-24 00:53:52,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:52" (1/1) ... [2020-10-24 00:53:52,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:52" (1/1) ... [2020-10-24 00:53:52,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:52" (1/1) ... [2020-10-24 00:53:52,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:52" (1/1) ... [2020-10-24 00:53:52,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:52" (1/1) ... [2020-10-24 00:53:52,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:52" (1/1) ... [2020-10-24 00:53:52,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:53:52,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:53:52,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:53:52,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:53:52,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:53:52,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:53:52,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:53:52,338 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:53:52,338 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-10-24 00:53:52,338 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:53:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:53:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:53:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:53:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:53:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:53:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-10-24 00:53:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:53:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:53:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:53:52,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:53:52,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:53:52,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:53:52,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:53:52,891 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:53:52,892 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:53:52,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:53:52 BoogieIcfgContainer [2020-10-24 00:53:52,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:53:52,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:53:52,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:53:52,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:53:52,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:53:51" (1/3) ... [2020-10-24 00:53:52,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e92f31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:53:52, skipping insertion in model container [2020-10-24 00:53:52,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:52" (2/3) ... [2020-10-24 00:53:52,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e92f31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:53:52, skipping insertion in model container [2020-10-24 00:53:52,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:53:52" (3/3) ... [2020-10-24 00:53:52,940 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-10-24 00:53:52,988 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:53:52,995 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:53:53,011 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:53:53,037 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:53:53,037 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:53:53,037 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:53:53,037 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:53:53,038 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:53:53,038 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:53:53,038 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:53:53,038 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:53:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-10-24 00:53:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:53:53,067 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:53,068 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-10-24 00:53:53,068 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:53,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-10-24 00:53:53,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:53,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719806954] [2020-10-24 00:53:53,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:53,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:53,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:53:53,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719806954] [2020-10-24 00:53:53,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:53:53,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:53:53,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736404522] [2020-10-24 00:53:53,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:53:53,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:53,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:53:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:53:53,504 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-10-24 00:53:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:53,874 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-10-24 00:53:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:53,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:53:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:53,886 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:53:53,887 INFO L226 Difference]: Without dead ends: 37 [2020-10-24 00:53:53,891 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-10-24 00:53:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-24 00:53:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-24 00:53:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:53:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-10-24 00:53:53,963 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-10-24 00:53:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:53,964 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-24 00:53:53,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:53:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-10-24 00:53:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 00:53:53,966 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:53,966 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-10-24 00:53:53,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:53:53,967 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-10-24 00:53:53,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:53,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568682277] [2020-10-24 00:53:53,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:54,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:54,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:53:54,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568682277] [2020-10-24 00:53:54,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:53:54,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:53:54,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027171594] [2020-10-24 00:53:54,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:53:54,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:54,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:53:54,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:53:54,124 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-10-24 00:53:54,541 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-10-24 00:53:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:54,661 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-10-24 00:53:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:54,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-24 00:53:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:54,664 INFO L225 Difference]: With dead ends: 46 [2020-10-24 00:53:54,667 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:53:54,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:53:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:53:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-10-24 00:53:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:53:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-10-24 00:53:54,687 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-10-24 00:53:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:54,688 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-24 00:53:54,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:53:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-10-24 00:53:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 00:53:54,690 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:54,691 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-10-24 00:53:54,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:53:54,691 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:54,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:54,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-10-24 00:53:54,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:54,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355987133] [2020-10-24 00:53:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:54,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:54,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:54,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:54,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:53:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 00:53:54,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355987133] [2020-10-24 00:53:54,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:54,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:53:54,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868738844] [2020-10-24 00:53:54,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:53:54,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:54,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:53:54,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:53:54,858 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-10-24 00:53:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:55,244 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-10-24 00:53:55,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:55,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-10-24 00:53:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:55,246 INFO L225 Difference]: With dead ends: 62 [2020-10-24 00:53:55,247 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:53:55,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:53:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:53:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-24 00:53:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 00:53:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-10-24 00:53:55,263 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-10-24 00:53:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:55,263 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-10-24 00:53:55,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:53:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-10-24 00:53:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:53:55,265 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:55,266 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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-10-24 00:53:55,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:53:55,266 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:55,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-10-24 00:53:55,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:55,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [387238979] [2020-10-24 00:53:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:55,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:55,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:55,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:55,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:53:55,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [387238979] [2020-10-24 00:53:55,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:55,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:53:55,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119159260] [2020-10-24 00:53:55,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:53:55,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:55,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:53:55,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:53:55,432 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-10-24 00:53:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:55,842 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-10-24 00:53:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:53:55,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-10-24 00:53:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:55,846 INFO L225 Difference]: With dead ends: 66 [2020-10-24 00:53:55,846 INFO L226 Difference]: Without dead ends: 59 [2020-10-24 00:53:55,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:53:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-24 00:53:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-24 00:53:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-24 00:53:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-10-24 00:53:55,870 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-10-24 00:53:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:55,871 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-10-24 00:53:55,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:53:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-10-24 00:53:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:53:55,874 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:55,874 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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] [2020-10-24 00:53:55,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:53:55,875 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-10-24 00:53:55,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:55,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [527436505] [2020-10-24 00:53:55,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:55,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:55,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-24 00:53:56,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [527436505] [2020-10-24 00:53:56,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:56,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:53:56,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004472497] [2020-10-24 00:53:56,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:53:56,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:56,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:53:56,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:53:56,152 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-10-24 00:53:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:56,610 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-10-24 00:53:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:53:56,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-10-24 00:53:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:56,614 INFO L225 Difference]: With dead ends: 118 [2020-10-24 00:53:56,614 INFO L226 Difference]: Without dead ends: 73 [2020-10-24 00:53:56,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:53:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-24 00:53:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-10-24 00:53:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 00:53:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-10-24 00:53:56,641 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-10-24 00:53:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:56,642 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-10-24 00:53:56,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:53:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-10-24 00:53:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:53:56,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:56,645 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2020-10-24 00:53:56,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:53:56,645 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:56,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:56,658 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-10-24 00:53:56,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:56,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [930241718] [2020-10-24 00:53:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-24 00:53:56,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [930241718] [2020-10-24 00:53:56,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:56,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:53:56,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140223829] [2020-10-24 00:53:56,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:53:56,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:56,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:53:56,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:53:56,860 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-10-24 00:53:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:57,304 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-10-24 00:53:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:53:57,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-10-24 00:53:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:57,308 INFO L225 Difference]: With dead ends: 96 [2020-10-24 00:53:57,308 INFO L226 Difference]: Without dead ends: 89 [2020-10-24 00:53:57,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:53:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-24 00:53:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-10-24 00:53:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-24 00:53:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-10-24 00:53:57,340 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-10-24 00:53:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:57,341 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-10-24 00:53:57,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:53:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-10-24 00:53:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-24 00:53:57,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:57,345 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:57,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:53:57,345 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:57,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:57,346 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-10-24 00:53:57,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:57,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1448112205] [2020-10-24 00:53:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-10-24 00:53:57,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1448112205] [2020-10-24 00:53:57,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:57,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:53:57,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822979763] [2020-10-24 00:53:57,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:53:57,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:57,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:53:57,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:53:57,695 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-10-24 00:53:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:58,341 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-10-24 00:53:58,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:53:58,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-10-24 00:53:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:58,347 INFO L225 Difference]: With dead ends: 146 [2020-10-24 00:53:58,348 INFO L226 Difference]: Without dead ends: 139 [2020-10-24 00:53:58,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:53:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-24 00:53:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-10-24 00:53:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-24 00:53:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-10-24 00:53:58,414 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-10-24 00:53:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:58,414 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-10-24 00:53:58,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:53:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-10-24 00:53:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-10-24 00:53:58,420 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:58,420 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:58,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:53:58,421 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-10-24 00:53:58,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:58,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [871910745] [2020-10-24 00:53:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 78 proven. 452 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2020-10-24 00:53:58,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [871910745] [2020-10-24 00:53:58,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:58,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:53:58,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734960527] [2020-10-24 00:53:58,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:53:58,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:58,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:53:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:53:58,925 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 10 states. [2020-10-24 00:53:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:59,782 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2020-10-24 00:53:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:53:59,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2020-10-24 00:53:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:59,788 INFO L225 Difference]: With dead ends: 240 [2020-10-24 00:53:59,788 INFO L226 Difference]: Without dead ends: 233 [2020-10-24 00:53:59,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:53:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-10-24 00:53:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 215. [2020-10-24 00:53:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-24 00:53:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2020-10-24 00:53:59,849 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 202 [2020-10-24 00:53:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:59,850 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2020-10-24 00:53:59,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:53:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2020-10-24 00:53:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-10-24 00:53:59,856 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:59,857 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:59,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:53:59,857 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:59,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash -509020704, now seen corresponding path program 6 times [2020-10-24 00:53:59,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:59,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1760236989] [2020-10-24 00:53:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:59,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:59,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:54:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:54:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:54:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:54:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:54:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:54:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:54:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 126 proven. 642 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2020-10-24 00:54:00,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1760236989] [2020-10-24 00:54:00,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:00,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:54:00,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628028380] [2020-10-24 00:54:00,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:54:00,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:00,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:54:00,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:54:00,457 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 11 states. [2020-10-24 00:54:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:01,482 INFO L93 Difference]: Finished difference Result 422 states and 653 transitions. [2020-10-24 00:54:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:54:01,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 237 [2020-10-24 00:54:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:01,493 INFO L225 Difference]: With dead ends: 422 [2020-10-24 00:54:01,493 INFO L226 Difference]: Without dead ends: 415 [2020-10-24 00:54:01,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:54:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-10-24 00:54:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 391. [2020-10-24 00:54:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-10-24 00:54:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 617 transitions. [2020-10-24 00:54:01,617 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 617 transitions. Word has length 237 [2020-10-24 00:54:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:01,618 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 617 transitions. [2020-10-24 00:54:01,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:54:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 617 transitions. [2020-10-24 00:54:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2020-10-24 00:54:01,632 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:01,632 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:01,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:54:01,633 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:01,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:01,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1781154385, now seen corresponding path program 7 times [2020-10-24 00:54:01,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:01,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1668994596] [2020-10-24 00:54:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:01,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:01,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:01,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:54:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:54:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:54:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:54:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:54:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:54:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:54:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-10-24 00:54:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:54:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:54:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:54:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:54:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:54:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:54:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:54:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:54:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6939 backedges. 1724 proven. 1617 refuted. 0 times theorem prover too weak. 3598 trivial. 0 not checked. [2020-10-24 00:54:03,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1668994596] [2020-10-24 00:54:03,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:03,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:54:03,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537243312] [2020-10-24 00:54:03,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:54:03,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:03,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:54:03,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:54:03,077 INFO L87 Difference]: Start difference. First operand 391 states and 617 transitions. Second operand 18 states. [2020-10-24 00:54:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:05,948 INFO L93 Difference]: Finished difference Result 533 states and 935 transitions. [2020-10-24 00:54:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-24 00:54:05,949 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 431 [2020-10-24 00:54:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:05,958 INFO L225 Difference]: With dead ends: 533 [2020-10-24 00:54:05,959 INFO L226 Difference]: Without dead ends: 155 [2020-10-24 00:54:05,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=477, Invalid=1875, Unknown=0, NotChecked=0, Total=2352 [2020-10-24 00:54:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-24 00:54:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 124. [2020-10-24 00:54:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-24 00:54:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 159 transitions. [2020-10-24 00:54:06,000 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 159 transitions. Word has length 431 [2020-10-24 00:54:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:06,001 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 159 transitions. [2020-10-24 00:54:06,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:54:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 159 transitions. [2020-10-24 00:54:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2020-10-24 00:54:06,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:06,009 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:06,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:54:06,009 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:06,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:06,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1553933834, now seen corresponding path program 8 times [2020-10-24 00:54:06,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:06,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [749248372] [2020-10-24 00:54:06,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:54:06,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:54:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:54:06,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:54:06,308 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:54:06,309 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:54:06,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:54:06,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:54:06 BoogieIcfgContainer [2020-10-24 00:54:06,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:54:06,473 INFO L168 Benchmark]: Toolchain (without parser) took 14573.14 ms. Allocated memory was 155.2 MB in the beginning and 446.7 MB in the end (delta: 291.5 MB). Free memory was 131.3 MB in the beginning and 353.9 MB in the end (delta: -222.6 MB). Peak memory consumption was 69.8 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:06,474 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 155.2 MB. Free memory was 129.5 MB in the beginning and 129.4 MB in the end (delta: 120.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:54:06,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.98 ms. Allocated memory is still 155.2 MB. Free memory was 130.7 MB in the beginning and 121.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:06,476 INFO L168 Benchmark]: Boogie Preprocessor took 35.26 ms. Allocated memory is still 155.2 MB. Free memory was 121.7 MB in the beginning and 119.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:06,476 INFO L168 Benchmark]: RCFGBuilder took 675.26 ms. Allocated memory is still 155.2 MB. Free memory was 119.8 MB in the beginning and 138.1 MB in the end (delta: -18.3 MB). Peak memory consumption was 17.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:06,477 INFO L168 Benchmark]: TraceAbstraction took 13548.47 ms. Allocated memory was 155.2 MB in the beginning and 446.7 MB in the end (delta: 291.5 MB). Free memory was 137.7 MB in the beginning and 353.9 MB in the end (delta: -216.2 MB). Peak memory consumption was 75.9 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:06,480 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.28 ms. Allocated memory is still 155.2 MB. Free memory was 129.5 MB in the beginning and 129.4 MB in the end (delta: 120.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 296.98 ms. Allocated memory is still 155.2 MB. Free memory was 130.7 MB in the beginning and 121.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.26 ms. Allocated memory is still 155.2 MB. Free memory was 121.7 MB in the beginning and 119.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 675.26 ms. Allocated memory is still 155.2 MB. Free memory was 119.8 MB in the beginning and 138.1 MB in the end (delta: -18.3 MB). Peak memory consumption was 17.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13548.47 ms. Allocated memory was 155.2 MB in the beginning and 446.7 MB in the end (delta: 291.5 MB). Free memory was 137.7 MB in the beginning and 353.9 MB in the end (delta: -216.2 MB). Peak memory consumption was 75.9 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: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L27] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L27] int result = fibo(x); VAL [fibo(x)=13, result=13, x=7] [L28] COND TRUE result == 13 VAL [result=13, x=7] [L29] CALL reach_error() [L4] __assert_fail("0", "fibo_7-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.2s, OverallIterations: 11, TraceHistogramMax: 47, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 398 SDtfs, 880 SDslu, 572 SDs, 0 SdLazy, 1609 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred 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.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 105 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1637 NumberOfCodeBlocks, 1637 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1249 ConstructedInterpolants, 0 QuantifiedInterpolants, 533647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 7808/10761 InterpolantCoveringCapability, 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...