/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 -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 11:18:06,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 11:18:06,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 11:18:06,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 11:18:06,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 11:18:06,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 11:18:06,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 11:18:06,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 11:18:06,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 11:18:06,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 11:18:06,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 11:18:06,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 11:18:06,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 11:18:06,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 11:18:06,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 11:18:06,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 11:18:06,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 11:18:06,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 11:18:06,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 11:18:06,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 11:18:06,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 11:18:06,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 11:18:06,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 11:18:06,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 11:18:06,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 11:18:06,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 11:18:06,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 11:18:06,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 11:18:06,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 11:18:06,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 11:18:06,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 11:18:06,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 11:18:06,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 11:18:06,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 11:18:06,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 11:18:06,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 11:18:06,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 11:18:06,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 11:18:06,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 11:18:06,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 11:18:06,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 11:18:06,625 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 11:18:06,664 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 11:18:06,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 11:18:06,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 11:18:06,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 11:18:06,667 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 11:18:06,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 11:18:06,668 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 11:18:06,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 11:18:06,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 11:18:06,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 11:18:06,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 11:18:06,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 11:18:06,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 11:18:06,670 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 11:18:06,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 11:18:06,671 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 11:18:06,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 11:18:06,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 11:18:06,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 11:18:06,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 11:18:06,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 11:18:06,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 11:18:06,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 11:18:06,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 11:18:06,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 11:18:06,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 11:18:06,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 11:18:06,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 11:18:06,673 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 11:18:06,673 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 [2020-08-18 11:18:06,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 11:18:06,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 11:18:06,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 11:18:06,979 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 11:18:06,980 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 11:18:06,980 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 11:18:07,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2477ab511/4a82805f2367443ba1d2009c409f954e/FLAGd9d9d9cf6 [2020-08-18 11:18:07,527 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 11:18:07,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 11:18:07,534 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2477ab511/4a82805f2367443ba1d2009c409f954e/FLAGd9d9d9cf6 [2020-08-18 11:18:07,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2477ab511/4a82805f2367443ba1d2009c409f954e [2020-08-18 11:18:07,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 11:18:07,913 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 11:18:07,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 11:18:07,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 11:18:07,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 11:18:07,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 11:18:07" (1/1) ... [2020-08-18 11:18:07,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738c85d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:07, skipping insertion in model container [2020-08-18 11:18:07,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 11:18:07" (1/1) ... [2020-08-18 11:18:07,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 11:18:07,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 11:18:08,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 11:18:08,100 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 11:18:08,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 11:18:08,130 INFO L208 MainTranslator]: Completed translation [2020-08-18 11:18:08,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:08 WrapperNode [2020-08-18 11:18:08,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 11:18:08,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 11:18:08,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 11:18:08,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 11:18:08,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:08" (1/1) ... [2020-08-18 11:18:08,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:08" (1/1) ... [2020-08-18 11:18:08,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:08" (1/1) ... [2020-08-18 11:18:08,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:08" (1/1) ... [2020-08-18 11:18:08,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:08" (1/1) ... [2020-08-18 11:18:08,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:08" (1/1) ... [2020-08-18 11:18:08,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:08" (1/1) ... [2020-08-18 11:18:08,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 11:18:08,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 11:18:08,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 11:18:08,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 11:18:08,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:08" (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 11:18:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 11:18:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 11:18:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-18 11:18:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 11:18:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 11:18:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 11:18:08,308 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-18 11:18:08,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 11:18:08,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 11:18:08,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 11:18:08,490 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 11:18:08,490 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 11:18:08,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 11:18:08 BoogieIcfgContainer [2020-08-18 11:18:08,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 11:18:08,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 11:18:08,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 11:18:08,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 11:18:08,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 11:18:07" (1/3) ... [2020-08-18 11:18:08,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ad491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 11:18:08, skipping insertion in model container [2020-08-18 11:18:08,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:18:08" (2/3) ... [2020-08-18 11:18:08,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ad491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 11:18:08, skipping insertion in model container [2020-08-18 11:18:08,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 11:18:08" (3/3) ... [2020-08-18 11:18:08,503 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-18 11:18:08,514 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 11:18:08,522 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 11:18:08,538 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 11:18:08,601 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 11:18:08,602 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 11:18:08,602 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 11:18:08,602 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 11:18:08,602 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 11:18:08,603 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 11:18:08,603 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 11:18:08,603 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 11:18:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-18 11:18:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 11:18:08,633 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:08,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:18:08,634 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:08,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:08,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-18 11:18:08,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:08,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2109858687] [2020-08-18 11:18:08,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:08,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:08,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:08,896 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 11:18:08,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2109858687] [2020-08-18 11:18:08,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 11:18:08,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 11:18:08,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074677619] [2020-08-18 11:18:08,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 11:18:08,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:08,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 11:18:08,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 11:18:08,918 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-18 11:18:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:09,036 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 11:18:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 11:18:09,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 11:18:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:09,048 INFO L225 Difference]: With dead ends: 35 [2020-08-18 11:18:09,048 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 11:18:09,052 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 11:18:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 11:18:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 11:18:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 11:18:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 11:18:09,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 11:18:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:09,095 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 11:18:09,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 11:18:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 11:18:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 11:18:09,097 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:09,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 11:18:09,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 11:18:09,098 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-18 11:18:09,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:09,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [8100293] [2020-08-18 11:18:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,165 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 11:18:09,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [8100293] [2020-08-18 11:18:09,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 11:18:09,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 11:18:09,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345885935] [2020-08-18 11:18:09,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 11:18:09,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 11:18:09,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 11:18:09,169 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 11:18:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:09,236 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 11:18:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 11:18:09,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 11:18:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:09,239 INFO L225 Difference]: With dead ends: 27 [2020-08-18 11:18:09,239 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 11:18:09,240 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 11:18:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 11:18:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 11:18:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 11:18:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 11:18:09,248 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 11:18:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:09,249 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 11:18:09,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 11:18:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 11:18:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 11:18:09,251 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:09,251 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 11:18:09,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 11:18:09,252 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-18 11:18:09,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:09,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1759220189] [2020-08-18 11:18:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 11:18:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,358 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 11:18:09,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1759220189] [2020-08-18 11:18:09,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:18:09,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 11:18:09,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799361946] [2020-08-18 11:18:09,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 11:18:09,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 11:18:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 11:18:09,361 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-18 11:18:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:09,439 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 11:18:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-18 11:18:09,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-18 11:18:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:09,442 INFO L225 Difference]: With dead ends: 38 [2020-08-18 11:18:09,442 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 11:18:09,443 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 11:18:09,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 11:18:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 11:18:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 11:18:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 11:18:09,451 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 11:18:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:09,452 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 11:18:09,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 11:18:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 11:18:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 11:18:09,454 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:09,454 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 11:18:09,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 11:18:09,455 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-18 11:18:09,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:09,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [5907349] [2020-08-18 11:18:09,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,562 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 11:18:09,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [5907349] [2020-08-18 11:18:09,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:18:09,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 11:18:09,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434687647] [2020-08-18 11:18:09,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 11:18:09,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:09,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 11:18:09,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 11:18:09,565 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 11:18:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:09,689 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 11:18:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 11:18:09,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 11:18:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:09,692 INFO L225 Difference]: With dead ends: 41 [2020-08-18 11:18:09,692 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 11:18:09,693 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 11:18:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 11:18:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 11:18:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 11:18:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 11:18:09,705 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 11:18:09,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:09,706 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 11:18:09,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 11:18:09,706 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 11:18:09,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 11:18:09,708 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:09,708 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 11:18:09,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 11:18:09,709 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:09,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:09,709 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-18 11:18:09,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:09,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [166926168] [2020-08-18 11:18:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:09,863 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 11:18:09,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [166926168] [2020-08-18 11:18:09,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:18:09,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 11:18:09,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262484564] [2020-08-18 11:18:09,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 11:18:09,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:09,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 11:18:09,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 11:18:09,866 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-18 11:18:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:09,985 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-18 11:18:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 11:18:09,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-18 11:18:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:09,988 INFO L225 Difference]: With dead ends: 76 [2020-08-18 11:18:09,989 INFO L226 Difference]: Without dead ends: 45 [2020-08-18 11:18:09,990 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 11:18:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-18 11:18:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-18 11:18:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-18 11:18:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-18 11:18:10,002 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-18 11:18:10,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:10,003 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-18 11:18:10,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 11:18:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-18 11:18:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 11:18:10,005 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:10,005 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 11:18:10,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 11:18:10,006 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:10,006 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-18 11:18:10,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:10,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [746315755] [2020-08-18 11:18:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,175 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 11:18:10,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [746315755] [2020-08-18 11:18:10,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:18:10,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 11:18:10,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717631813] [2020-08-18 11:18:10,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 11:18:10,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:10,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 11:18:10,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 11:18:10,179 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-18 11:18:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:10,305 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-18 11:18:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 11:18:10,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 11:18:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:10,308 INFO L225 Difference]: With dead ends: 62 [2020-08-18 11:18:10,308 INFO L226 Difference]: Without dead ends: 58 [2020-08-18 11:18:10,309 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 11:18:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-18 11:18:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-18 11:18:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-18 11:18:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-18 11:18:10,322 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-18 11:18:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:10,323 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-18 11:18:10,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 11:18:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-18 11:18:10,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-18 11:18:10,327 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:10,328 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 11:18:10,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 11:18:10,330 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:10,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:10,330 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-18 11:18:10,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:10,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1726164276] [2020-08-18 11:18:10,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,614 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 11:18:10,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1726164276] [2020-08-18 11:18:10,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:18:10,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 11:18:10,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359233923] [2020-08-18 11:18:10,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 11:18:10,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:10,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 11:18:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-18 11:18:10,617 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-18 11:18:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:10,763 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-18 11:18:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 11:18:10,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-18 11:18:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:10,768 INFO L225 Difference]: With dead ends: 97 [2020-08-18 11:18:10,768 INFO L226 Difference]: Without dead ends: 93 [2020-08-18 11:18:10,769 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 11:18:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-18 11:18:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-18 11:18:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-18 11:18:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-18 11:18:10,787 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-18 11:18:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:10,788 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-18 11:18:10,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 11:18:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-18 11:18:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-18 11:18:10,800 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:10,801 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 11:18:10,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 11:18:10,801 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:10,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-18 11:18:10,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:10,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [544903094] [2020-08-18 11:18:10,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:10,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 11:18:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 11:18:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,365 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 11:18:11,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [544903094] [2020-08-18 11:18:11,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:18:11,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-18 11:18:11,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652001916] [2020-08-18 11:18:11,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 11:18:11,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:11,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 11:18:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-18 11:18:11,368 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-18 11:18:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:11,802 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-18 11:18:11,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-18 11:18:11,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-18 11:18:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:11,805 INFO L225 Difference]: With dead ends: 153 [2020-08-18 11:18:11,805 INFO L226 Difference]: Without dead ends: 71 [2020-08-18 11:18:11,808 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 11:18:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-18 11:18:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-18 11:18:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-18 11:18:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-18 11:18:11,818 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-18 11:18:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:11,819 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-18 11:18:11,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 11:18:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-18 11:18:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-18 11:18:11,821 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:11,821 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 11:18:11,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 11:18:11,822 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:11,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-18 11:18:11,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:11,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1899862454] [2020-08-18 11:18:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:11,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 11:18:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,066 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 11:18:12,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1899862454] [2020-08-18 11:18:12,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:18:12,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-18 11:18:12,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672136805] [2020-08-18 11:18:12,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 11:18:12,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:12,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 11:18:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-18 11:18:12,068 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-18 11:18:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:12,222 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-18 11:18:12,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 11:18:12,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-18 11:18:12,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:12,224 INFO L225 Difference]: With dead ends: 68 [2020-08-18 11:18:12,225 INFO L226 Difference]: Without dead ends: 64 [2020-08-18 11:18:12,225 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 11:18:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-18 11:18:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-18 11:18:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-18 11:18:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-18 11:18:12,234 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-18 11:18:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:12,234 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-18 11:18:12,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 11:18:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-18 11:18:12,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 11:18:12,236 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:12,237 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 11:18:12,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 11:18:12,237 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:12,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:12,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-18 11:18:12,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:12,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1640424854] [2020-08-18 11:18:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 11:18:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 11:18:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:12,643 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 11:18:12,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1640424854] [2020-08-18 11:18:12,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:18:12,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 11:18:12,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718882884] [2020-08-18 11:18:12,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 11:18:12,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:12,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 11:18:12,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 11:18:12,645 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-18 11:18:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:12,868 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-18 11:18:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 11:18:12,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 11:18:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:12,872 INFO L225 Difference]: With dead ends: 180 [2020-08-18 11:18:12,872 INFO L226 Difference]: Without dead ends: 176 [2020-08-18 11:18:12,873 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 11:18:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-18 11:18:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-18 11:18:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-18 11:18:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-18 11:18:12,894 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-18 11:18:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:12,895 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-18 11:18:12,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 11:18:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-18 11:18:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-18 11:18:12,911 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:12,911 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 11:18:12,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 11:18:12,912 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-18 11:18:12,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:12,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1074136560] [2020-08-18 11:18:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 11:18:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 11:18:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 11:18:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 11:18:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:13,918 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 11:18:13,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1074136560] [2020-08-18 11:18:13,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:18:13,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 11:18:13,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130236076] [2020-08-18 11:18:13,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 11:18:13,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:13,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 11:18:13,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-18 11:18:13,921 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-18 11:18:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:14,200 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-18 11:18:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-18 11:18:14,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-18 11:18:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:14,206 INFO L225 Difference]: With dead ends: 410 [2020-08-18 11:18:14,206 INFO L226 Difference]: Without dead ends: 406 [2020-08-18 11:18:14,208 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 11:18:14,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-18 11:18:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-18 11:18:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-18 11:18:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-18 11:18:14,269 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-18 11:18:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:14,270 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-18 11:18:14,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 11:18:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-18 11:18:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-18 11:18:14,283 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:14,284 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 11:18:14,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 11:18:14,284 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:14,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-18 11:18:14,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:14,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1616499775] [2020-08-18 11:18:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:14,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 11:18:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:14,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 11:18:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:14,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 11:18:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 11:18:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 11:18:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 11:18:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 11:18:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 11:18:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 11:18:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 11:18:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 11:18:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 11:18:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 11:18:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:15,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 11:18:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 11:18:16,475 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 11:18:16,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1616499775] [2020-08-18 11:18:16,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 11:18:16,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-18 11:18:16,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097274855] [2020-08-18 11:18:16,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-18 11:18:16,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 11:18:16,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-18 11:18:16,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-18 11:18:16,478 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-18 11:18:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 11:18:17,436 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-18 11:18:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-18 11:18:17,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-18 11:18:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 11:18:17,442 INFO L225 Difference]: With dead ends: 531 [2020-08-18 11:18:17,442 INFO L226 Difference]: Without dead ends: 148 [2020-08-18 11:18:17,448 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 11:18:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-18 11:18:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-18 11:18:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-18 11:18:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-18 11:18:17,458 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-18 11:18:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 11:18:17,459 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-18 11:18:17,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-18 11:18:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-18 11:18:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-18 11:18:17,468 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 11:18:17,468 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 11:18:17,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 11:18:17,469 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 11:18:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 11:18:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-18 11:18:17,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 11:18:17,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1674884596] [2020-08-18 11:18:17,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 11:18:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 11:18:17,569 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 11:18:17,569 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 11:18:17,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 11:18:17,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 11:18:17 BoogieIcfgContainer [2020-08-18 11:18:17,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 11:18:17,666 INFO L168 Benchmark]: Toolchain (without parser) took 9747.50 ms. Allocated memory was 140.5 MB in the beginning and 509.1 MB in the end (delta: 368.6 MB). Free memory was 103.8 MB in the beginning and 207.7 MB in the end (delta: -103.9 MB). Peak memory consumption was 264.7 MB. Max. memory is 7.1 GB. [2020-08-18 11:18:17,667 INFO L168 Benchmark]: CDTParser took 0.17 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: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-18 11:18:17,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.48 ms. Allocated memory is still 140.5 MB. Free memory was 103.6 MB in the beginning and 94.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-18 11:18:17,669 INFO L168 Benchmark]: Boogie Preprocessor took 28.86 ms. Allocated memory is still 140.5 MB. Free memory was 94.3 MB in the beginning and 93.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-18 11:18:17,670 INFO L168 Benchmark]: RCFGBuilder took 333.04 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 92.7 MB in the beginning and 171.4 MB in the end (delta: -78.7 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2020-08-18 11:18:17,676 INFO L168 Benchmark]: TraceAbstraction took 9162.63 ms. Allocated memory was 203.4 MB in the beginning and 509.1 MB in the end (delta: 305.7 MB). Free memory was 170.8 MB in the beginning and 207.7 MB in the end (delta: -36.9 MB). Peak memory consumption was 268.8 MB. Max. memory is 7.1 GB. [2020-08-18 11:18:17,681 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.17 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: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 215.48 ms. Allocated memory is still 140.5 MB. Free memory was 103.6 MB in the beginning and 94.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.86 ms. Allocated memory is still 140.5 MB. Free memory was 94.3 MB in the beginning and 93.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 333.04 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 92.7 MB in the beginning and 171.4 MB in the end (delta: -78.7 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9162.63 ms. Allocated memory was 203.4 MB in the beginning and 509.1 MB in the end (delta: 305.7 MB). Free memory was 170.8 MB in the beginning and 207.7 MB in the end (delta: -36.9 MB). Peak memory consumption was 268.8 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: 8.9s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1352 SolverSat, 480 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.6s 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.6s 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...