/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.2 -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 23:29:29,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 23:29:29,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 23:29:29,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 23:29:29,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 23:29:29,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 23:29:29,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 23:29:29,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 23:29:29,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 23:29:29,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 23:29:29,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 23:29:29,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 23:29:29,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 23:29:29,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 23:29:29,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 23:29:29,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 23:29:29,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 23:29:29,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 23:29:29,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 23:29:29,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 23:29:29,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 23:29:29,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 23:29:29,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 23:29:29,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 23:29:29,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 23:29:29,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 23:29:29,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 23:29:29,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 23:29:29,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 23:29:29,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 23:29:29,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 23:29:29,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 23:29:29,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 23:29:29,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 23:29:29,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 23:29:29,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 23:29:29,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 23:29:29,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 23:29:29,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 23:29:29,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 23:29:29,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 23:29:29,652 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 23:29:29,674 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 23:29:29,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 23:29:29,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 23:29:29,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 23:29:29,676 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 23:29:29,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 23:29:29,677 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 23:29:29,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 23:29:29,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 23:29:29,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 23:29:29,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 23:29:29,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 23:29:29,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 23:29:29,678 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 23:29:29,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 23:29:29,678 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 23:29:29,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 23:29:29,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 23:29:29,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 23:29:29,679 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 23:29:29,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 23:29:29,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 23:29:29,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 23:29:29,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 23:29:29,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 23:29:29,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 23:29:29,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 23:29:29,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 23:29:29,681 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 23:29:29,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.2; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.2; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.2; [2020-08-18 23:29:29,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 23:29:30,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 23:29:30,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 23:29:30,010 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 23:29:30,011 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 23:29:30,011 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 23:29:30,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1f391bb29/e035b9477b3b4eb3b5129fa61bc736ff/FLAG5e835435c [2020-08-18 23:29:30,544 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 23:29:30,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 23:29:30,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1f391bb29/e035b9477b3b4eb3b5129fa61bc736ff/FLAG5e835435c [2020-08-18 23:29:30,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1f391bb29/e035b9477b3b4eb3b5129fa61bc736ff [2020-08-18 23:29:30,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 23:29:30,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 23:29:30,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 23:29:30,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 23:29:30,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 23:29:30,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 11:29:30" (1/1) ... [2020-08-18 23:29:30,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb58955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:30, skipping insertion in model container [2020-08-18 23:29:30,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 11:29:30" (1/1) ... [2020-08-18 23:29:30,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 23:29:30,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 23:29:31,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 23:29:31,151 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 23:29:31,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 23:29:31,190 INFO L208 MainTranslator]: Completed translation [2020-08-18 23:29:31,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:31 WrapperNode [2020-08-18 23:29:31,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 23:29:31,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 23:29:31,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 23:29:31,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 23:29:31,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:31" (1/1) ... [2020-08-18 23:29:31,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:31" (1/1) ... [2020-08-18 23:29:31,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:31" (1/1) ... [2020-08-18 23:29:31,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:31" (1/1) ... [2020-08-18 23:29:31,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:31" (1/1) ... [2020-08-18 23:29:31,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:31" (1/1) ... [2020-08-18 23:29:31,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:31" (1/1) ... [2020-08-18 23:29:31,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 23:29:31,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 23:29:31,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 23:29:31,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 23:29:31,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:31" (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 23:29:31,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 23:29:31,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 23:29:31,416 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-18 23:29:31,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 23:29:31,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 23:29:31,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 23:29:31,419 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-18 23:29:31,419 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 23:29:31,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 23:29:31,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 23:29:31,606 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 23:29:31,606 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 23:29:31,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 11:29:31 BoogieIcfgContainer [2020-08-18 23:29:31,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 23:29:31,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 23:29:31,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 23:29:31,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 23:29:31,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 11:29:30" (1/3) ... [2020-08-18 23:29:31,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2914c5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 11:29:31, skipping insertion in model container [2020-08-18 23:29:31,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:29:31" (2/3) ... [2020-08-18 23:29:31,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2914c5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 11:29:31, skipping insertion in model container [2020-08-18 23:29:31,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 11:29:31" (3/3) ... [2020-08-18 23:29:31,620 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-18 23:29:31,631 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 23:29:31,639 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 23:29:31,654 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 23:29:31,679 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 23:29:31,679 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 23:29:31,679 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 23:29:31,679 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 23:29:31,679 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 23:29:31,680 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 23:29:31,680 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 23:29:31,680 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 23:29:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-18 23:29:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 23:29:31,704 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:31,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 23:29:31,705 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-18 23:29:31,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:31,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [528541554] [2020-08-18 23:29:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:31,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:31,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:31,968 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 23:29:31,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [528541554] [2020-08-18 23:29:31,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 23:29:31,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 23:29:31,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649228990] [2020-08-18 23:29:31,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 23:29:31,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:31,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 23:29:31,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 23:29:31,999 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-18 23:29:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:32,232 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 23:29:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 23:29:32,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 23:29:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:32,249 INFO L225 Difference]: With dead ends: 35 [2020-08-18 23:29:32,249 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 23:29:32,253 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 23:29:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 23:29:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 23:29:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 23:29:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 23:29:32,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 23:29:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:32,303 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 23:29:32,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 23:29:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 23:29:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 23:29:32,306 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:32,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 23:29:32,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 23:29:32,307 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:32,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:32,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-18 23:29:32,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:32,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1441251054] [2020-08-18 23:29:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,405 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 23:29:32,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1441251054] [2020-08-18 23:29:32,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 23:29:32,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 23:29:32,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558332732] [2020-08-18 23:29:32,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 23:29:32,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:32,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 23:29:32,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 23:29:32,410 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 23:29:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:32,501 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 23:29:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 23:29:32,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 23:29:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:32,504 INFO L225 Difference]: With dead ends: 27 [2020-08-18 23:29:32,504 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 23:29:32,505 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 23:29:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 23:29:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 23:29:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 23:29:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 23:29:32,513 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 23:29:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:32,514 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 23:29:32,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 23:29:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 23:29:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 23:29:32,516 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:32,516 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 23:29:32,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 23:29:32,517 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-18 23:29:32,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:32,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1810166598] [2020-08-18 23:29:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 23:29:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,640 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 23:29:32,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1810166598] [2020-08-18 23:29:32,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 23:29:32,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 23:29:32,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898467306] [2020-08-18 23:29:32,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 23:29:32,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:32,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 23:29:32,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 23:29:32,643 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-18 23:29:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:32,742 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 23:29:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-18 23:29:32,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-18 23:29:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:32,745 INFO L225 Difference]: With dead ends: 38 [2020-08-18 23:29:32,745 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 23:29:32,746 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 23:29:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 23:29:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 23:29:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 23:29:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 23:29:32,754 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 23:29:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:32,755 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 23:29:32,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 23:29:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 23:29:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 23:29:32,757 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:32,757 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 23:29:32,757 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 23:29:32,757 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-18 23:29:32,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:32,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [891983795] [2020-08-18 23:29:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:32,862 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 23:29:32,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [891983795] [2020-08-18 23:29:32,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 23:29:32,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 23:29:32,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391428834] [2020-08-18 23:29:32,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 23:29:32,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 23:29:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 23:29:32,866 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 23:29:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:33,023 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 23:29:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 23:29:33,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 23:29:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:33,026 INFO L225 Difference]: With dead ends: 41 [2020-08-18 23:29:33,027 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 23:29:33,027 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 23:29:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 23:29:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 23:29:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 23:29:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 23:29:33,039 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 23:29:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:33,040 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 23:29:33,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 23:29:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 23:29:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 23:29:33,042 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:33,042 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 23:29:33,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 23:29:33,043 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:33,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-18 23:29:33,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:33,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [153184971] [2020-08-18 23:29:33,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,185 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 23:29:33,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [153184971] [2020-08-18 23:29:33,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 23:29:33,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 23:29:33,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837543776] [2020-08-18 23:29:33,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 23:29:33,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 23:29:33,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 23:29:33,189 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-18 23:29:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:33,315 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-18 23:29:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 23:29:33,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-18 23:29:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:33,318 INFO L225 Difference]: With dead ends: 76 [2020-08-18 23:29:33,319 INFO L226 Difference]: Without dead ends: 45 [2020-08-18 23:29:33,320 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 23:29:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-18 23:29:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-18 23:29:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-18 23:29:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-18 23:29:33,333 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-18 23:29:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:33,333 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-18 23:29:33,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 23:29:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-18 23:29:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 23:29:33,336 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:33,336 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 23:29:33,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 23:29:33,336 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:33,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:33,337 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-18 23:29:33,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:33,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [628896206] [2020-08-18 23:29:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,456 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 23:29:33,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [628896206] [2020-08-18 23:29:33,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 23:29:33,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 23:29:33,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328638062] [2020-08-18 23:29:33,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 23:29:33,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 23:29:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 23:29:33,459 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-18 23:29:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:33,562 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-18 23:29:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 23:29:33,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 23:29:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:33,565 INFO L225 Difference]: With dead ends: 62 [2020-08-18 23:29:33,565 INFO L226 Difference]: Without dead ends: 58 [2020-08-18 23:29:33,566 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 23:29:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-18 23:29:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-18 23:29:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-18 23:29:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-18 23:29:33,580 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-18 23:29:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:33,580 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-18 23:29:33,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 23:29:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-18 23:29:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-18 23:29:33,585 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:33,585 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 23:29:33,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 23:29:33,585 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-18 23:29:33,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:33,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1516892934] [2020-08-18 23:29:33,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:33,917 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 23:29:33,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1516892934] [2020-08-18 23:29:33,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 23:29:33,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 23:29:33,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578241129] [2020-08-18 23:29:33,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 23:29:33,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:33,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 23:29:33,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-18 23:29:33,922 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-18 23:29:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:34,086 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-18 23:29:34,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 23:29:34,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-18 23:29:34,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:34,091 INFO L225 Difference]: With dead ends: 97 [2020-08-18 23:29:34,091 INFO L226 Difference]: Without dead ends: 93 [2020-08-18 23:29:34,092 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 23:29:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-18 23:29:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-18 23:29:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-18 23:29:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-18 23:29:34,112 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-18 23:29:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:34,113 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-18 23:29:34,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 23:29:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-18 23:29:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-18 23:29:34,117 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:34,117 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 23:29:34,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 23:29:34,118 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-18 23:29:34,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:34,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1420935] [2020-08-18 23:29:34,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 23:29:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 23:29:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,519 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 23:29:34,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1420935] [2020-08-18 23:29:34,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 23:29:34,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-18 23:29:34,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380740229] [2020-08-18 23:29:34,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 23:29:34,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:34,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 23:29:34,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-18 23:29:34,523 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-18 23:29:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:34,910 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-18 23:29:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-18 23:29:34,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-18 23:29:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:34,912 INFO L225 Difference]: With dead ends: 153 [2020-08-18 23:29:34,912 INFO L226 Difference]: Without dead ends: 71 [2020-08-18 23:29:34,916 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 23:29:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-18 23:29:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-18 23:29:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-18 23:29:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-18 23:29:34,933 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-18 23:29:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:34,933 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-18 23:29:34,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 23:29:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-18 23:29:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-18 23:29:34,935 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:34,936 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 23:29:34,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 23:29:34,936 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-18 23:29:34,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:34,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1413812271] [2020-08-18 23:29:34,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:34,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 23:29:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,188 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 23:29:35,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1413812271] [2020-08-18 23:29:35,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 23:29:35,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-18 23:29:35,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262164288] [2020-08-18 23:29:35,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 23:29:35,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:35,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 23:29:35,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-18 23:29:35,191 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-18 23:29:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:35,359 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-18 23:29:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 23:29:35,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-18 23:29:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:35,362 INFO L225 Difference]: With dead ends: 68 [2020-08-18 23:29:35,362 INFO L226 Difference]: Without dead ends: 64 [2020-08-18 23:29:35,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-18 23:29:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-18 23:29:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-18 23:29:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-18 23:29:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-18 23:29:35,372 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-18 23:29:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:35,372 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-18 23:29:35,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 23:29:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-18 23:29:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 23:29:35,375 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:35,375 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 23:29:35,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 23:29:35,376 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-18 23:29:35,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:35,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1918561789] [2020-08-18 23:29:35,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 23:29:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 23:29:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:35,782 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 23:29:35,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1918561789] [2020-08-18 23:29:35,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 23:29:35,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 23:29:35,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049526379] [2020-08-18 23:29:35,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 23:29:35,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:35,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 23:29:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 23:29:35,785 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-18 23:29:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:36,010 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-18 23:29:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 23:29:36,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 23:29:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:36,014 INFO L225 Difference]: With dead ends: 180 [2020-08-18 23:29:36,014 INFO L226 Difference]: Without dead ends: 176 [2020-08-18 23:29:36,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-18 23:29:36,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-18 23:29:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-18 23:29:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-18 23:29:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-18 23:29:36,033 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-18 23:29:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:36,034 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-18 23:29:36,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 23:29:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-18 23:29:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-18 23:29:36,038 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:36,039 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 23:29:36,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 23:29:36,039 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-18 23:29:36,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:36,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [455069396] [2020-08-18 23:29:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 23:29:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 23:29:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 23:29:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 23:29:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:36,889 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 23:29:36,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [455069396] [2020-08-18 23:29:36,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 23:29:36,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 23:29:36,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991377347] [2020-08-18 23:29:36,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 23:29:36,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:36,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 23:29:36,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-18 23:29:36,892 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-18 23:29:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:37,153 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-18 23:29:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-18 23:29:37,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-18 23:29:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:37,159 INFO L225 Difference]: With dead ends: 410 [2020-08-18 23:29:37,159 INFO L226 Difference]: Without dead ends: 406 [2020-08-18 23:29:37,161 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 23:29:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-18 23:29:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-18 23:29:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-18 23:29:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-18 23:29:37,219 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-18 23:29:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:37,220 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-18 23:29:37,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 23:29:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-18 23:29:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-18 23:29:37,232 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:37,233 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 23:29:37,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 23:29:37,233 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-18 23:29:37,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:37,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1982767126] [2020-08-18 23:29:37,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:37,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 23:29:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:37,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 23:29:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:37,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:37,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 23:29:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 23:29:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 23:29:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 23:29:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 23:29:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 23:29:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 23:29:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 23:29:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 23:29:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 23:29:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 23:29:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:38,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 23:29:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 23:29:39,353 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 23:29:39,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1982767126] [2020-08-18 23:29:39,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 23:29:39,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-18 23:29:39,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145131334] [2020-08-18 23:29:39,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-18 23:29:39,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 23:29:39,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-18 23:29:39,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-18 23:29:39,356 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-18 23:29:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 23:29:40,260 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-18 23:29:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-18 23:29:40,261 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-18 23:29:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 23:29:40,266 INFO L225 Difference]: With dead ends: 531 [2020-08-18 23:29:40,266 INFO L226 Difference]: Without dead ends: 148 [2020-08-18 23:29:40,270 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 23:29:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-18 23:29:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-18 23:29:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-18 23:29:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-18 23:29:40,279 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-18 23:29:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 23:29:40,280 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-18 23:29:40,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-18 23:29:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-18 23:29:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-18 23:29:40,288 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 23:29:40,289 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 23:29:40,289 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 23:29:40,289 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 23:29:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 23:29:40,290 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-18 23:29:40,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 23:29:40,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1760117683] [2020-08-18 23:29:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 23:29:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 23:29:40,391 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 23:29:40,391 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 23:29:40,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 23:29:40,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 11:29:40 BoogieIcfgContainer [2020-08-18 23:29:40,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 23:29:40,444 INFO L168 Benchmark]: Toolchain (without parser) took 9511.26 ms. Allocated memory was 140.5 MB in the beginning and 520.1 MB in the end (delta: 379.6 MB). Free memory was 103.3 MB in the beginning and 164.1 MB in the end (delta: -60.7 MB). Peak memory consumption was 318.8 MB. Max. memory is 7.1 GB. [2020-08-18 23:29:40,445 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-18 23:29:40,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.06 ms. Allocated memory is still 140.5 MB. Free memory was 103.1 MB in the beginning and 93.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-18 23:29:40,446 INFO L168 Benchmark]: Boogie Preprocessor took 130.67 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 93.8 MB in the beginning and 182.2 MB in the end (delta: -88.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2020-08-18 23:29:40,447 INFO L168 Benchmark]: RCFGBuilder took 288.01 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 169.8 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2020-08-18 23:29:40,448 INFO L168 Benchmark]: TraceAbstraction took 8828.65 ms. Allocated memory was 203.4 MB in the beginning and 520.1 MB in the end (delta: 316.7 MB). Free memory was 169.2 MB in the beginning and 164.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 321.8 MB. Max. memory is 7.1 GB. [2020-08-18 23:29:40,452 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.32 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.06 ms. Allocated memory is still 140.5 MB. Free memory was 103.1 MB in the beginning and 93.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.67 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 93.8 MB in the beginning and 182.2 MB in the end (delta: -88.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 288.01 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 169.8 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8828.65 ms. Allocated memory was 203.4 MB in the beginning and 520.1 MB in the end (delta: 316.7 MB). Free memory was 169.2 MB in the beginning and 164.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 321.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.7s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1360 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.3s 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...