/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLEST -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 17:02:40,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 17:02:40,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 17:02:40,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 17:02:40,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 17:02:40,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 17:02:40,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 17:02:40,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 17:02:40,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 17:02:40,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 17:02:40,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 17:02:40,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 17:02:40,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 17:02:40,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 17:02:40,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 17:02:40,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 17:02:40,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 17:02:40,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 17:02:40,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 17:02:40,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 17:02:40,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 17:02:40,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 17:02:40,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 17:02:40,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 17:02:40,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 17:02:40,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 17:02:40,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 17:02:40,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 17:02:40,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 17:02:40,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 17:02:40,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 17:02:40,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 17:02:40,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 17:02:40,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 17:02:40,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 17:02:40,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 17:02:40,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 17:02:40,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 17:02:40,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 17:02:40,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 17:02:40,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 17:02:40,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-18 17:02:40,838 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 17:02:40,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 17:02:40,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 17:02:40,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 17:02:40,840 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 17:02:40,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 17:02:40,841 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 17:02:40,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 17:02:40,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 17:02:40,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 17:02:40,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 17:02:40,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 17:02:40,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 17:02:40,842 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 17:02:40,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 17:02:40,843 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 17:02:40,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 17:02:40,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 17:02:40,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 17:02:40,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 17:02:40,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 17:02:40,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 17:02:40,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 17:02:40,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 17:02:40,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 17:02:40,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 17:02:40,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 17:02:40,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 17:02:40,845 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 17:02:40,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLEST; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLEST; [2020-08-18 17:02:41,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 17:02:41,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 17:02:41,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 17:02:41,185 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 17:02:41,186 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 17:02:41,187 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 17:02:41,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b53da4d23/e00949762e2d4622a90b90ac41dfa470/FLAG99a4bf786 [2020-08-18 17:02:41,703 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 17:02:41,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 17:02:41,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b53da4d23/e00949762e2d4622a90b90ac41dfa470/FLAG99a4bf786 [2020-08-18 17:02:42,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b53da4d23/e00949762e2d4622a90b90ac41dfa470 [2020-08-18 17:02:42,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 17:02:42,058 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 17:02:42,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 17:02:42,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 17:02:42,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 17:02:42,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 05:02:42" (1/1) ... [2020-08-18 17:02:42,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f284b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42, skipping insertion in model container [2020-08-18 17:02:42,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 05:02:42" (1/1) ... [2020-08-18 17:02:42,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 17:02:42,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 17:02:42,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 17:02:42,279 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 17:02:42,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 17:02:42,304 INFO L208 MainTranslator]: Completed translation [2020-08-18 17:02:42,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42 WrapperNode [2020-08-18 17:02:42,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 17:02:42,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 17:02:42,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 17:02:42,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 17:02:42,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42" (1/1) ... [2020-08-18 17:02:42,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42" (1/1) ... [2020-08-18 17:02:42,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42" (1/1) ... [2020-08-18 17:02:42,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42" (1/1) ... [2020-08-18 17:02:42,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42" (1/1) ... [2020-08-18 17:02:42,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42" (1/1) ... [2020-08-18 17:02:42,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42" (1/1) ... [2020-08-18 17:02:42,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 17:02:42,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 17:02:42,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 17:02:42,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 17:02:42,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-08-18 17:02:42,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 17:02:42,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 17:02:42,489 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-18 17:02:42,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 17:02:42,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 17:02:42,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 17:02:42,491 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-18 17:02:42,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 17:02:42,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 17:02:42,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 17:02:42,668 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 17:02:42,669 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 17:02:42,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 05:02:42 BoogieIcfgContainer [2020-08-18 17:02:42,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 17:02:42,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 17:02:42,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 17:02:42,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 17:02:42,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 05:02:42" (1/3) ... [2020-08-18 17:02:42,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f15b8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 05:02:42, skipping insertion in model container [2020-08-18 17:02:42,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:02:42" (2/3) ... [2020-08-18 17:02:42,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f15b8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 05:02:42, skipping insertion in model container [2020-08-18 17:02:42,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 05:02:42" (3/3) ... [2020-08-18 17:02:42,682 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-18 17:02:42,693 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 17:02:42,700 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 17:02:42,715 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 17:02:42,740 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 17:02:42,741 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 17:02:42,741 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 17:02:42,741 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 17:02:42,741 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 17:02:42,741 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 17:02:42,742 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 17:02:42,742 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 17:02:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-18 17:02:42,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 17:02:42,765 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:42,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:42,766 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:42,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-18 17:02:42,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:42,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1502194171] [2020-08-18 17:02:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:42,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:42,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:02:43,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1502194171] [2020-08-18 17:02:43,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:02:43,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 17:02:43,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822007775] [2020-08-18 17:02:43,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 17:02:43,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:43,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 17:02:43,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 17:02:43,056 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-18 17:02:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:43,179 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 17:02:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 17:02:43,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 17:02:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:43,194 INFO L225 Difference]: With dead ends: 35 [2020-08-18 17:02:43,194 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 17:02:43,198 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-18 17:02:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 17:02:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 17:02:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 17:02:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 17:02:43,248 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 17:02:43,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:43,248 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 17:02:43,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 17:02:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 17:02:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 17:02:43,251 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:43,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:43,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 17:02:43,252 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-18 17:02:43,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:43,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [98753377] [2020-08-18 17:02:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 17:02:43,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [98753377] [2020-08-18 17:02:43,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:02:43,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 17:02:43,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131065578] [2020-08-18 17:02:43,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 17:02:43,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:43,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 17:02:43,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 17:02:43,329 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 17:02:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:43,401 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 17:02:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 17:02:43,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 17:02:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:43,403 INFO L225 Difference]: With dead ends: 27 [2020-08-18 17:02:43,403 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 17:02:43,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-18 17:02:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 17:02:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 17:02:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 17:02:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 17:02:43,414 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 17:02:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:43,414 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 17:02:43,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 17:02:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 17:02:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 17:02:43,416 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:43,417 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] [2020-08-18 17:02:43,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 17:02:43,417 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:43,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-18 17:02:43,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:43,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883321044] [2020-08-18 17:02:43,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 17:02:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-18 17:02:43,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883321044] [2020-08-18 17:02:43,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:02:43,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 17:02:43,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698184616] [2020-08-18 17:02:43,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 17:02:43,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:43,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 17:02:43,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 17:02:43,557 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-18 17:02:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:43,681 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 17:02:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-18 17:02:43,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-18 17:02:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:43,684 INFO L225 Difference]: With dead ends: 38 [2020-08-18 17:02:43,684 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 17:02:43,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-18 17:02:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 17:02:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 17:02:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 17:02:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 17:02:43,704 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 17:02:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:43,705 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 17:02:43,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 17:02:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 17:02:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 17:02:43,710 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:43,711 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] [2020-08-18 17:02:43,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 17:02:43,712 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:43,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-18 17:02:43,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:43,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1997025285] [2020-08-18 17:02:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-18 17:02:43,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1997025285] [2020-08-18 17:02:43,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:02:43,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 17:02:43,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58069714] [2020-08-18 17:02:43,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 17:02:43,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:43,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 17:02:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 17:02:43,867 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 17:02:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:43,987 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 17:02:43,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 17:02:43,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 17:02:43,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:43,990 INFO L225 Difference]: With dead ends: 41 [2020-08-18 17:02:43,990 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 17:02:43,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-18 17:02:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 17:02:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 17:02:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 17:02:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 17:02:44,004 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 17:02:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:44,004 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 17:02:44,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 17:02:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 17:02:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 17:02:44,007 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:44,007 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:44,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 17:02:44,007 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:44,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:44,008 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-18 17:02:44,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:44,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016124401] [2020-08-18 17:02:44,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-18 17:02:44,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2016124401] [2020-08-18 17:02:44,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:02:44,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 17:02:44,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348148883] [2020-08-18 17:02:44,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 17:02:44,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:44,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 17:02:44,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 17:02:44,241 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-18 17:02:44,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:44,369 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-18 17:02:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 17:02:44,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-18 17:02:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:44,374 INFO L225 Difference]: With dead ends: 76 [2020-08-18 17:02:44,375 INFO L226 Difference]: Without dead ends: 45 [2020-08-18 17:02:44,377 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-18 17:02:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-18 17:02:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-18 17:02:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-18 17:02:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-18 17:02:44,389 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-18 17:02:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:44,390 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-18 17:02:44,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 17:02:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-18 17:02:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 17:02:44,392 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:44,393 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:44,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 17:02:44,393 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:44,394 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-18 17:02:44,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:44,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2055137379] [2020-08-18 17:02:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-18 17:02:44,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2055137379] [2020-08-18 17:02:44,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:02:44,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 17:02:44,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103497290] [2020-08-18 17:02:44,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 17:02:44,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:44,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 17:02:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 17:02:44,504 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-18 17:02:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:44,621 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-18 17:02:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 17:02:44,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 17:02:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:44,623 INFO L225 Difference]: With dead ends: 62 [2020-08-18 17:02:44,624 INFO L226 Difference]: Without dead ends: 58 [2020-08-18 17:02:44,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 17:02:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-18 17:02:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-18 17:02:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-18 17:02:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-18 17:02:44,638 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-18 17:02:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:44,639 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-18 17:02:44,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 17:02:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-18 17:02:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-18 17:02:44,643 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:44,644 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:44,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 17:02:44,644 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:44,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:44,645 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-18 17:02:44,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:44,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [175873403] [2020-08-18 17:02:44,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-18 17:02:44,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [175873403] [2020-08-18 17:02:44,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:02:44,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 17:02:44,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375849366] [2020-08-18 17:02:44,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 17:02:44,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:44,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 17:02:44,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-18 17:02:44,894 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-18 17:02:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:45,082 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-18 17:02:45,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 17:02:45,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-18 17:02:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:45,087 INFO L225 Difference]: With dead ends: 97 [2020-08-18 17:02:45,088 INFO L226 Difference]: Without dead ends: 93 [2020-08-18 17:02:45,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-18 17:02:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-18 17:02:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-18 17:02:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-18 17:02:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-18 17:02:45,109 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-18 17:02:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:45,109 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-18 17:02:45,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 17:02:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-18 17:02:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-18 17:02:45,114 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:45,114 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:45,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 17:02:45,115 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:45,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:45,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-18 17:02:45,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:45,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [116745227] [2020-08-18 17:02:45,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:02:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:02:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-18 17:02:45,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [116745227] [2020-08-18 17:02:45,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:02:45,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-18 17:02:45,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361908724] [2020-08-18 17:02:45,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 17:02:45,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:45,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 17:02:45,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-18 17:02:45,520 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-18 17:02:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:45,998 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-18 17:02:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-18 17:02:45,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-18 17:02:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:46,000 INFO L225 Difference]: With dead ends: 153 [2020-08-18 17:02:46,001 INFO L226 Difference]: Without dead ends: 71 [2020-08-18 17:02:46,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-18 17:02:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-18 17:02:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-18 17:02:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-18 17:02:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-18 17:02:46,014 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-18 17:02:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:46,014 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-18 17:02:46,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 17:02:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-18 17:02:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-18 17:02:46,016 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:46,017 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:46,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 17:02:46,017 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:46,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:46,018 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-18 17:02:46,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:46,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [537232921] [2020-08-18 17:02:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:02:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-18 17:02:46,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [537232921] [2020-08-18 17:02:46,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:02:46,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-18 17:02:46,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174770930] [2020-08-18 17:02:46,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 17:02:46,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:46,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 17:02:46,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-18 17:02:46,245 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-18 17:02:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:46,396 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-18 17:02:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 17:02:46,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-18 17:02:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:46,398 INFO L225 Difference]: With dead ends: 68 [2020-08-18 17:02:46,398 INFO L226 Difference]: Without dead ends: 64 [2020-08-18 17:02:46,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-18 17:02:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-18 17:02:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-18 17:02:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-18 17:02:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-18 17:02:46,409 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-18 17:02:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:46,410 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-18 17:02:46,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 17:02:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-18 17:02:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 17:02:46,413 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:46,413 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:46,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 17:02:46,414 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:46,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-18 17:02:46,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:46,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2109783796] [2020-08-18 17:02:46,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:02:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 17:02:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-18 17:02:46,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2109783796] [2020-08-18 17:02:46,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:02:46,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 17:02:46,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340682389] [2020-08-18 17:02:46,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 17:02:46,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:46,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 17:02:46,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 17:02:46,797 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-18 17:02:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:47,028 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-18 17:02:47,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 17:02:47,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 17:02:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:47,033 INFO L225 Difference]: With dead ends: 180 [2020-08-18 17:02:47,033 INFO L226 Difference]: Without dead ends: 176 [2020-08-18 17:02:47,035 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-18 17:02:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-18 17:02:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-18 17:02:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-18 17:02:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-18 17:02:47,075 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-18 17:02:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:47,080 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-18 17:02:47,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 17:02:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-18 17:02:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-18 17:02:47,087 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:47,087 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:47,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 17:02:47,087 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:47,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:47,088 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-18 17:02:47,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:47,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [657520101] [2020-08-18 17:02:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:02:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 17:02:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 17:02:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:02:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-18 17:02:47,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [657520101] [2020-08-18 17:02:47,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:02:47,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 17:02:47,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207433334] [2020-08-18 17:02:47,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 17:02:47,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:47,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 17:02:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-18 17:02:47,860 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-18 17:02:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:48,175 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-18 17:02:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-18 17:02:48,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-18 17:02:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:48,183 INFO L225 Difference]: With dead ends: 410 [2020-08-18 17:02:48,184 INFO L226 Difference]: Without dead ends: 406 [2020-08-18 17:02:48,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-18 17:02:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-18 17:02:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-18 17:02:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-18 17:02:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-18 17:02:48,247 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-18 17:02:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:48,247 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-18 17:02:48,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 17:02:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-18 17:02:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-18 17:02:48,259 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:48,260 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:48,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 17:02:48,260 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:48,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:48,261 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-18 17:02:48,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:48,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1183866782] [2020-08-18 17:02:48,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:48,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:02:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:48,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:02:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:48,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:48,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:48,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:48,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:48,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:48,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:02:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 17:02:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 17:02:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:02:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 17:02:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:02:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 17:02:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 17:02:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:02:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:02:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:02:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:49,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:02:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:02:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-08-18 17:02:50,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1183866782] [2020-08-18 17:02:50,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:02:50,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-18 17:02:50,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009102055] [2020-08-18 17:02:50,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-18 17:02:50,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:02:50,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-18 17:02:50,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-18 17:02:50,682 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-18 17:02:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:02:51,652 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-18 17:02:51,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-18 17:02:51,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-18 17:02:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:02:51,655 INFO L225 Difference]: With dead ends: 531 [2020-08-18 17:02:51,655 INFO L226 Difference]: Without dead ends: 148 [2020-08-18 17:02:51,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-18 17:02:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-18 17:02:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-18 17:02:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-18 17:02:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-18 17:02:51,675 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-18 17:02:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:02:51,676 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-18 17:02:51,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-18 17:02:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-18 17:02:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-18 17:02:51,685 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:02:51,685 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:02:51,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 17:02:51,685 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:02:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:02:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-18 17:02:51,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:02:51,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2105647274] [2020-08-18 17:02:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:02:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 17:02:51,793 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 17:02:51,793 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 17:02:51,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 17:02:51,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 05:02:51 BoogieIcfgContainer [2020-08-18 17:02:51,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 17:02:51,882 INFO L168 Benchmark]: Toolchain (without parser) took 9823.52 ms. Allocated memory was 140.5 MB in the beginning and 561.0 MB in the end (delta: 420.5 MB). Free memory was 104.3 MB in the beginning and 426.7 MB in the end (delta: -322.5 MB). Peak memory consumption was 98.0 MB. Max. memory is 7.1 GB. [2020-08-18 17:02:51,883 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-18 17:02:51,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.37 ms. Allocated memory is still 140.5 MB. Free memory was 104.1 MB in the beginning and 94.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-18 17:02:51,884 INFO L168 Benchmark]: Boogie Preprocessor took 105.45 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 94.8 MB in the beginning and 183.1 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-18 17:02:51,885 INFO L168 Benchmark]: RCFGBuilder took 262.67 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 171.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2020-08-18 17:02:51,886 INFO L168 Benchmark]: TraceAbstraction took 9205.07 ms. Allocated memory was 203.9 MB in the beginning and 561.0 MB in the end (delta: 357.0 MB). Free memory was 170.4 MB in the beginning and 426.7 MB in the end (delta: -256.3 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. [2020-08-18 17:02:51,889 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 245.37 ms. Allocated memory is still 140.5 MB. Free memory was 104.1 MB in the beginning and 94.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.45 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 94.8 MB in the beginning and 183.1 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 262.67 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 171.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9205.07 ms. Allocated memory was 203.9 MB in the beginning and 561.0 MB in the end (delta: 357.0 MB). Free memory was 170.4 MB in the beginning and 426.7 MB in the end (delta: -256.3 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.0s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1358 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 657826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 19463/24904 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...