/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.4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 00:20:05,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 00:20:05,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 00:20:06,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 00:20:06,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 00:20:06,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 00:20:06,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 00:20:06,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 00:20:06,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 00:20:06,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 00:20:06,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 00:20:06,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 00:20:06,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 00:20:06,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 00:20:06,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 00:20:06,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 00:20:06,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 00:20:06,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 00:20:06,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 00:20:06,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 00:20:06,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 00:20:06,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 00:20:06,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 00:20:06,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 00:20:06,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 00:20:06,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 00:20:06,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 00:20:06,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 00:20:06,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 00:20:06,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 00:20:06,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 00:20:06,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 00:20:06,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 00:20:06,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 00:20:06,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 00:20:06,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 00:20:06,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 00:20:06,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 00:20:06,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 00:20:06,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 00:20:06,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 00:20:06,053 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-19 00:20:06,103 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 00:20:06,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 00:20:06,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 00:20:06,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 00:20:06,105 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 00:20:06,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 00:20:06,109 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 00:20:06,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 00:20:06,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 00:20:06,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 00:20:06,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 00:20:06,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 00:20:06,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 00:20:06,110 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 00:20:06,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 00:20:06,111 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 00:20:06,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 00:20:06,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 00:20:06,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 00:20:06,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 00:20:06,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 00:20:06,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 00:20:06,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 00:20:06,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 00:20:06,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 00:20:06,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 00:20:06,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 00:20:06,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 00:20:06,115 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 00:20:06,115 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.4; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4; [2020-08-19 00:20:06,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 00:20:06,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 00:20:06,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 00:20:06,485 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 00:20:06,486 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 00:20:06,487 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-08-19 00:20:06,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d8aec4410/3fad01b5ae824527a6ccd3da6f1b8f32/FLAGfc596169c [2020-08-19 00:20:07,034 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 00:20:07,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-08-19 00:20:07,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d8aec4410/3fad01b5ae824527a6ccd3da6f1b8f32/FLAGfc596169c [2020-08-19 00:20:07,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d8aec4410/3fad01b5ae824527a6ccd3da6f1b8f32 [2020-08-19 00:20:07,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 00:20:07,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 00:20:07,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 00:20:07,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 00:20:07,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 00:20:07,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 12:20:07" (1/1) ... [2020-08-19 00:20:07,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1987833a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07, skipping insertion in model container [2020-08-19 00:20:07,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 12:20:07" (1/1) ... [2020-08-19 00:20:07,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 00:20:07,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 00:20:07,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 00:20:07,647 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 00:20:07,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 00:20:07,679 INFO L208 MainTranslator]: Completed translation [2020-08-19 00:20:07,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07 WrapperNode [2020-08-19 00:20:07,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 00:20:07,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 00:20:07,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 00:20:07,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 00:20:07,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07" (1/1) ... [2020-08-19 00:20:07,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07" (1/1) ... [2020-08-19 00:20:07,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07" (1/1) ... [2020-08-19 00:20:07,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07" (1/1) ... [2020-08-19 00:20:07,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07" (1/1) ... [2020-08-19 00:20:07,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07" (1/1) ... [2020-08-19 00:20:07,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07" (1/1) ... [2020-08-19 00:20:07,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 00:20:07,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 00:20:07,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 00:20:07,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 00:20:07,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07" (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-19 00:20:07,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 00:20:07,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 00:20:07,853 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-08-19 00:20:07,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 00:20:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 00:20:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-08-19 00:20:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 00:20:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 00:20:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 00:20:08,030 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 00:20:08,031 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 00:20:08,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 12:20:08 BoogieIcfgContainer [2020-08-19 00:20:08,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 00:20:08,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 00:20:08,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 00:20:08,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 00:20:08,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 12:20:07" (1/3) ... [2020-08-19 00:20:08,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a01a83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 12:20:08, skipping insertion in model container [2020-08-19 00:20:08,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:07" (2/3) ... [2020-08-19 00:20:08,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a01a83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 12:20:08, skipping insertion in model container [2020-08-19 00:20:08,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 12:20:08" (3/3) ... [2020-08-19 00:20:08,043 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2020-08-19 00:20:08,053 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 00:20:08,061 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 00:20:08,074 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 00:20:08,103 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 00:20:08,103 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 00:20:08,103 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 00:20:08,103 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 00:20:08,103 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 00:20:08,103 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 00:20:08,104 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 00:20:08,104 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 00:20:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-08-19 00:20:08,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 00:20:08,126 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:08,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:08,127 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:08,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2020-08-19 00:20:08,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:08,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1993550524] [2020-08-19 00:20:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,400 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-19 00:20:08,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1993550524] [2020-08-19 00:20:08,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:20:08,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 00:20:08,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931042367] [2020-08-19 00:20:08,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 00:20:08,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:08,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 00:20:08,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 00:20:08,436 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-08-19 00:20:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:08,532 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-08-19 00:20:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 00:20:08,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 00:20:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:08,546 INFO L225 Difference]: With dead ends: 30 [2020-08-19 00:20:08,547 INFO L226 Difference]: Without dead ends: 18 [2020-08-19 00:20:08,551 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-19 00:20:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-08-19 00:20:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-08-19 00:20:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-08-19 00:20:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-08-19 00:20:08,617 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-08-19 00:20:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:08,618 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-08-19 00:20:08,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 00:20:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-08-19 00:20:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-19 00:20:08,625 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:08,626 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:08,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 00:20:08,629 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:08,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:08,630 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2020-08-19 00:20:08,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:08,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [675489227] [2020-08-19 00:20:08,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-19 00:20:08,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [675489227] [2020-08-19 00:20:08,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:08,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 00:20:08,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544622740] [2020-08-19 00:20:08,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 00:20:08,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:08,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 00:20:08,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 00:20:08,801 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-08-19 00:20:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:08,866 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-08-19 00:20:08,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 00:20:08,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-08-19 00:20:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:08,868 INFO L225 Difference]: With dead ends: 25 [2020-08-19 00:20:08,868 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 00:20:08,870 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-19 00:20:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 00:20:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 00:20:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 00:20:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-08-19 00:20:08,876 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-08-19 00:20:08,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:08,877 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-08-19 00:20:08,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 00:20:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-08-19 00:20:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-19 00:20:08,879 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:08,879 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:08,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 00:20:08,879 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:08,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2020-08-19 00:20:08,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:08,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014977148] [2020-08-19 00:20:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-08-19 00:20:09,041 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014977148] [2020-08-19 00:20:09,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:09,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 00:20:09,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67280306] [2020-08-19 00:20:09,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 00:20:09,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:09,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 00:20:09,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:20:09,045 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-08-19 00:20:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:09,145 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-08-19 00:20:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 00:20:09,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-08-19 00:20:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:09,147 INFO L225 Difference]: With dead ends: 28 [2020-08-19 00:20:09,147 INFO L226 Difference]: Without dead ends: 24 [2020-08-19 00:20:09,148 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-19 00:20:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-08-19 00:20:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-08-19 00:20:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-08-19 00:20:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-08-19 00:20:09,155 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-08-19 00:20:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:09,155 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-08-19 00:20:09,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 00:20:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-08-19 00:20:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-19 00:20:09,157 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:09,157 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:09,158 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 00:20:09,158 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:09,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:09,158 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2020-08-19 00:20:09,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:09,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1150601279] [2020-08-19 00:20:09,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-19 00:20:09,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1150601279] [2020-08-19 00:20:09,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:09,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 00:20:09,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137560177] [2020-08-19 00:20:09,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 00:20:09,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:09,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 00:20:09,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 00:20:09,391 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-08-19 00:20:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:09,471 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-08-19 00:20:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 00:20:09,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-08-19 00:20:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:09,473 INFO L225 Difference]: With dead ends: 31 [2020-08-19 00:20:09,474 INFO L226 Difference]: Without dead ends: 27 [2020-08-19 00:20:09,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 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-19 00:20:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-08-19 00:20:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-08-19 00:20:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-08-19 00:20:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-08-19 00:20:09,481 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-08-19 00:20:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:09,481 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-08-19 00:20:09,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 00:20:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-08-19 00:20:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-19 00:20:09,483 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:09,483 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:09,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 00:20:09,484 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:09,484 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2020-08-19 00:20:09,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:09,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626901086] [2020-08-19 00:20:09,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-19 00:20:09,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626901086] [2020-08-19 00:20:09,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:09,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 00:20:09,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212041010] [2020-08-19 00:20:09,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 00:20:09,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:09,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 00:20:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-19 00:20:09,713 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-08-19 00:20:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:09,797 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-08-19 00:20:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 00:20:09,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-08-19 00:20:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:09,799 INFO L225 Difference]: With dead ends: 34 [2020-08-19 00:20:09,799 INFO L226 Difference]: Without dead ends: 30 [2020-08-19 00:20:09,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-19 00:20:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-19 00:20:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-19 00:20:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-19 00:20:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-08-19 00:20:09,806 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-08-19 00:20:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:09,807 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-08-19 00:20:09,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 00:20:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-08-19 00:20:09,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-19 00:20:09,808 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:09,809 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:09,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 00:20:09,809 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:09,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:09,810 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2020-08-19 00:20:09,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:09,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2032664991] [2020-08-19 00:20:09,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-19 00:20:09,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2032664991] [2020-08-19 00:20:09,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:09,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 00:20:09,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827295970] [2020-08-19 00:20:09,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:20:09,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:20:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:20:09,977 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-08-19 00:20:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:10,069 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-08-19 00:20:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 00:20:10,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-08-19 00:20:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:10,071 INFO L225 Difference]: With dead ends: 37 [2020-08-19 00:20:10,071 INFO L226 Difference]: Without dead ends: 33 [2020-08-19 00:20:10,072 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 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-19 00:20:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-19 00:20:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-19 00:20:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-19 00:20:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-08-19 00:20:10,079 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-08-19 00:20:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:10,080 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-08-19 00:20:10,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:20:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-08-19 00:20:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-19 00:20:10,082 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:10,082 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:10,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 00:20:10,083 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:10,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2020-08-19 00:20:10,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:10,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [947858858] [2020-08-19 00:20:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-19 00:20:10,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [947858858] [2020-08-19 00:20:10,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:10,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 00:20:10,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434736118] [2020-08-19 00:20:10,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 00:20:10,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:10,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 00:20:10,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-19 00:20:10,311 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-08-19 00:20:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:10,433 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-08-19 00:20:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 00:20:10,433 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-08-19 00:20:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:10,435 INFO L225 Difference]: With dead ends: 40 [2020-08-19 00:20:10,435 INFO L226 Difference]: Without dead ends: 36 [2020-08-19 00:20:10,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 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-19 00:20:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-08-19 00:20:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-08-19 00:20:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-08-19 00:20:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-08-19 00:20:10,443 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-08-19 00:20:10,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:10,443 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-08-19 00:20:10,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 00:20:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-08-19 00:20:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-19 00:20:10,445 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:10,445 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:10,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 00:20:10,445 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2020-08-19 00:20:10,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:10,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014796072] [2020-08-19 00:20:10,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-19 00:20:10,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014796072] [2020-08-19 00:20:10,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:10,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 00:20:10,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237219042] [2020-08-19 00:20:10,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 00:20:10,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:10,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 00:20:10,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-08-19 00:20:10,680 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-08-19 00:20:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:10,825 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-08-19 00:20:10,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 00:20:10,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-08-19 00:20:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:10,827 INFO L225 Difference]: With dead ends: 43 [2020-08-19 00:20:10,827 INFO L226 Difference]: Without dead ends: 39 [2020-08-19 00:20:10,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-08-19 00:20:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-19 00:20:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-19 00:20:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 00:20:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-08-19 00:20:10,836 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-08-19 00:20:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:10,837 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-08-19 00:20:10,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 00:20:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-08-19 00:20:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-19 00:20:10,839 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:10,839 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:10,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 00:20:10,839 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:10,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2020-08-19 00:20:10,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:10,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [757987980] [2020-08-19 00:20:10,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-08-19 00:20:11,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [757987980] [2020-08-19 00:20:11,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:11,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-19 00:20:11,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806604180] [2020-08-19 00:20:11,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-19 00:20:11,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:11,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-19 00:20:11,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-19 00:20:11,116 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-08-19 00:20:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:11,295 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-08-19 00:20:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-19 00:20:11,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-08-19 00:20:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:11,297 INFO L225 Difference]: With dead ends: 46 [2020-08-19 00:20:11,298 INFO L226 Difference]: Without dead ends: 42 [2020-08-19 00:20:11,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-19 00:20:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-19 00:20:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-19 00:20:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-19 00:20:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-08-19 00:20:11,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-08-19 00:20:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:11,313 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-08-19 00:20:11,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-19 00:20:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-08-19 00:20:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-19 00:20:11,315 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:11,315 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:11,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 00:20:11,316 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:11,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2020-08-19 00:20:11,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:11,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [385447565] [2020-08-19 00:20:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-08-19 00:20:11,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [385447565] [2020-08-19 00:20:11,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:11,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-19 00:20:11,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236583356] [2020-08-19 00:20:11,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-19 00:20:11,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:11,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-19 00:20:11,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-08-19 00:20:11,718 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-08-19 00:20:11,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:11,869 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-08-19 00:20:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 00:20:11,871 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-08-19 00:20:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:11,873 INFO L225 Difference]: With dead ends: 49 [2020-08-19 00:20:11,873 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 00:20:11,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-08-19 00:20:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 00:20:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-19 00:20:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-19 00:20:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-08-19 00:20:11,888 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-08-19 00:20:11,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:11,888 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-08-19 00:20:11,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-19 00:20:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-08-19 00:20:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-19 00:20:11,890 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:11,890 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:11,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 00:20:11,891 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:11,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2020-08-19 00:20:11,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:11,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1917448046] [2020-08-19 00:20:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-08-19 00:20:12,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1917448046] [2020-08-19 00:20:12,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:12,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-19 00:20:12,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170526051] [2020-08-19 00:20:12,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-19 00:20:12,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:12,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-19 00:20:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-08-19 00:20:12,358 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-08-19 00:20:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:12,550 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-08-19 00:20:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-19 00:20:12,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-08-19 00:20:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:12,552 INFO L225 Difference]: With dead ends: 52 [2020-08-19 00:20:12,552 INFO L226 Difference]: Without dead ends: 48 [2020-08-19 00:20:12,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-08-19 00:20:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-19 00:20:12,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-08-19 00:20:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-19 00:20:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-08-19 00:20:12,567 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-08-19 00:20:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:12,567 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-08-19 00:20:12,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-19 00:20:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-08-19 00:20:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-19 00:20:12,570 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:12,571 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:12,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 00:20:12,571 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2020-08-19 00:20:12,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:12,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [810211502] [2020-08-19 00:20:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-08-19 00:20:12,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [810211502] [2020-08-19 00:20:12,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:12,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-19 00:20:12,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532320946] [2020-08-19 00:20:12,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-19 00:20:12,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:12,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-19 00:20:12,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-08-19 00:20:12,997 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-08-19 00:20:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:13,194 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-08-19 00:20:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 00:20:13,194 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-08-19 00:20:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:13,195 INFO L225 Difference]: With dead ends: 55 [2020-08-19 00:20:13,195 INFO L226 Difference]: Without dead ends: 51 [2020-08-19 00:20:13,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-08-19 00:20:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-08-19 00:20:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-08-19 00:20:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-08-19 00:20:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-08-19 00:20:13,202 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-08-19 00:20:13,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:13,203 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-08-19 00:20:13,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-19 00:20:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-08-19 00:20:13,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-19 00:20:13,204 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:13,204 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:13,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 00:20:13,205 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:13,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:13,205 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2020-08-19 00:20:13,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:13,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [154828925] [2020-08-19 00:20:13,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-08-19 00:20:13,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [154828925] [2020-08-19 00:20:13,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:13,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-19 00:20:13,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216776921] [2020-08-19 00:20:13,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-19 00:20:13,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:13,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-19 00:20:13,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-08-19 00:20:13,673 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2020-08-19 00:20:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:13,870 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-08-19 00:20:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-19 00:20:13,871 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-08-19 00:20:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:13,872 INFO L225 Difference]: With dead ends: 58 [2020-08-19 00:20:13,872 INFO L226 Difference]: Without dead ends: 54 [2020-08-19 00:20:13,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-08-19 00:20:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-08-19 00:20:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-08-19 00:20:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-19 00:20:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-08-19 00:20:13,880 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-08-19 00:20:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:13,880 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-08-19 00:20:13,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-19 00:20:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-08-19 00:20:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-19 00:20:13,882 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:13,882 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:13,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 00:20:13,883 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2020-08-19 00:20:13,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:13,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2073268490] [2020-08-19 00:20:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-08-19 00:20:14,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2073268490] [2020-08-19 00:20:14,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:14,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-19 00:20:14,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247514299] [2020-08-19 00:20:14,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-19 00:20:14,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-19 00:20:14,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-08-19 00:20:14,504 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2020-08-19 00:20:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:14,758 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-08-19 00:20:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-19 00:20:14,758 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2020-08-19 00:20:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:14,760 INFO L225 Difference]: With dead ends: 61 [2020-08-19 00:20:14,760 INFO L226 Difference]: Without dead ends: 57 [2020-08-19 00:20:14,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-08-19 00:20:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-19 00:20:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-08-19 00:20:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-19 00:20:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-08-19 00:20:14,774 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-08-19 00:20:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:14,779 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-08-19 00:20:14,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-19 00:20:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-08-19 00:20:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-19 00:20:14,780 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:14,780 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:14,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-19 00:20:14,781 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:14,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:14,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2020-08-19 00:20:14,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:14,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1047780250] [2020-08-19 00:20:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-08-19 00:20:15,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1047780250] [2020-08-19 00:20:15,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:15,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-19 00:20:15,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146921728] [2020-08-19 00:20:15,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-19 00:20:15,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:15,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-19 00:20:15,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-08-19 00:20:15,404 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2020-08-19 00:20:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:15,672 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-08-19 00:20:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-19 00:20:15,673 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-08-19 00:20:15,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:15,674 INFO L225 Difference]: With dead ends: 64 [2020-08-19 00:20:15,674 INFO L226 Difference]: Without dead ends: 60 [2020-08-19 00:20:15,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-08-19 00:20:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-08-19 00:20:15,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-08-19 00:20:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-08-19 00:20:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-08-19 00:20:15,681 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-08-19 00:20:15,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:15,681 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-08-19 00:20:15,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-19 00:20:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-08-19 00:20:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-08-19 00:20:15,683 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:15,683 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:15,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-19 00:20:15,683 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:15,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2020-08-19 00:20:15,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:15,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1764079815] [2020-08-19 00:20:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-08-19 00:20:16,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1764079815] [2020-08-19 00:20:16,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:16,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-08-19 00:20:16,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328560100] [2020-08-19 00:20:16,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-19 00:20:16,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:16,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-19 00:20:16,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-08-19 00:20:16,400 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2020-08-19 00:20:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:16,697 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-08-19 00:20:16,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-19 00:20:16,697 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2020-08-19 00:20:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:16,698 INFO L225 Difference]: With dead ends: 67 [2020-08-19 00:20:16,698 INFO L226 Difference]: Without dead ends: 63 [2020-08-19 00:20:16,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-08-19 00:20:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-08-19 00:20:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-08-19 00:20:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-08-19 00:20:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-08-19 00:20:16,705 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-08-19 00:20:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:16,705 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-08-19 00:20:16,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-19 00:20:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-08-19 00:20:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 00:20:16,707 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:16,707 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:16,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-19 00:20:16,707 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:16,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:16,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1066046876, now seen corresponding path program 16 times [2020-08-19 00:20:16,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:16,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1375394189] [2020-08-19 00:20:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-08-19 00:20:17,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1375394189] [2020-08-19 00:20:17,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:17,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-08-19 00:20:17,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985436482] [2020-08-19 00:20:17,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-19 00:20:17,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-19 00:20:17,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-08-19 00:20:17,441 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2020-08-19 00:20:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:17,701 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-08-19 00:20:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 00:20:17,702 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2020-08-19 00:20:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:17,704 INFO L225 Difference]: With dead ends: 70 [2020-08-19 00:20:17,704 INFO L226 Difference]: Without dead ends: 66 [2020-08-19 00:20:17,705 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-08-19 00:20:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-08-19 00:20:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-08-19 00:20:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-19 00:20:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-08-19 00:20:17,710 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2020-08-19 00:20:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:17,711 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-08-19 00:20:17,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-19 00:20:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-08-19 00:20:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-08-19 00:20:17,712 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:17,712 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:17,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-19 00:20:17,713 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1300351236, now seen corresponding path program 17 times [2020-08-19 00:20:17,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:17,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1402176042] [2020-08-19 00:20:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-08-19 00:20:18,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1402176042] [2020-08-19 00:20:18,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:18,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-08-19 00:20:18,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140918425] [2020-08-19 00:20:18,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-08-19 00:20:18,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:18,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-08-19 00:20:18,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-08-19 00:20:18,558 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2020-08-19 00:20:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:18,837 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-08-19 00:20:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-19 00:20:18,837 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2020-08-19 00:20:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:18,838 INFO L225 Difference]: With dead ends: 73 [2020-08-19 00:20:18,839 INFO L226 Difference]: Without dead ends: 69 [2020-08-19 00:20:18,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-08-19 00:20:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-08-19 00:20:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-08-19 00:20:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-08-19 00:20:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-08-19 00:20:18,845 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2020-08-19 00:20:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:18,845 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-08-19 00:20:18,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-08-19 00:20:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-08-19 00:20:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-19 00:20:18,847 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:18,847 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:18,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-19 00:20:18,848 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:18,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:18,848 INFO L82 PathProgramCache]: Analyzing trace with hash 227065820, now seen corresponding path program 18 times [2020-08-19 00:20:18,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:18,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1642077321] [2020-08-19 00:20:18,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-08-19 00:20:19,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1642077321] [2020-08-19 00:20:19,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:19,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-08-19 00:20:19,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152429041] [2020-08-19 00:20:19,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-08-19 00:20:19,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:19,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-08-19 00:20:19,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-08-19 00:20:19,698 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2020-08-19 00:20:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:20,010 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-08-19 00:20:20,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-19 00:20:20,011 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2020-08-19 00:20:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:20,012 INFO L225 Difference]: With dead ends: 76 [2020-08-19 00:20:20,012 INFO L226 Difference]: Without dead ends: 72 [2020-08-19 00:20:20,014 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-08-19 00:20:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-08-19 00:20:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-08-19 00:20:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-19 00:20:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-08-19 00:20:20,018 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2020-08-19 00:20:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:20,019 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-08-19 00:20:20,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-08-19 00:20:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-08-19 00:20:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-08-19 00:20:20,020 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:20,021 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:20,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-08-19 00:20:20,021 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash -479687356, now seen corresponding path program 19 times [2020-08-19 00:20:20,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:20,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156370522] [2020-08-19 00:20:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-08-19 00:20:20,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156370522] [2020-08-19 00:20:20,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:20,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-08-19 00:20:20,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3034502] [2020-08-19 00:20:20,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-08-19 00:20:20,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:20,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-08-19 00:20:20,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-08-19 00:20:20,960 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2020-08-19 00:20:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:21,247 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-08-19 00:20:21,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-19 00:20:21,247 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2020-08-19 00:20:21,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:21,248 INFO L225 Difference]: With dead ends: 79 [2020-08-19 00:20:21,248 INFO L226 Difference]: Without dead ends: 75 [2020-08-19 00:20:21,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-08-19 00:20:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-08-19 00:20:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-08-19 00:20:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-08-19 00:20:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-08-19 00:20:21,255 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2020-08-19 00:20:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:21,255 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-08-19 00:20:21,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-08-19 00:20:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-08-19 00:20:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-08-19 00:20:21,257 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:21,257 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:21,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-08-19 00:20:21,257 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:21,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:21,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1598174692, now seen corresponding path program 20 times [2020-08-19 00:20:21,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:21,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [415858350] [2020-08-19 00:20:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 00:20:21,285 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 00:20:21,286 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 00:20:21,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-08-19 00:20:21,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 12:20:21 BoogieIcfgContainer [2020-08-19 00:20:21,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 00:20:21,321 INFO L168 Benchmark]: Toolchain (without parser) took 13902.47 ms. Allocated memory was 140.5 MB in the beginning and 467.7 MB in the end (delta: 327.2 MB). Free memory was 103.8 MB in the beginning and 294.1 MB in the end (delta: -190.3 MB). Peak memory consumption was 136.9 MB. Max. memory is 7.1 GB. [2020-08-19 00:20:21,321 INFO L168 Benchmark]: CDTParser took 0.27 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: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-19 00:20:21,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.30 ms. Allocated memory is still 140.5 MB. Free memory was 103.6 MB in the beginning and 94.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-19 00:20:21,322 INFO L168 Benchmark]: Boogie Preprocessor took 30.02 ms. Allocated memory is still 140.5 MB. Free memory was 94.3 MB in the beginning and 93.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-19 00:20:21,323 INFO L168 Benchmark]: RCFGBuilder took 324.26 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 93.0 MB in the beginning and 171.4 MB in the end (delta: -78.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-08-19 00:20:21,324 INFO L168 Benchmark]: TraceAbstraction took 13281.84 ms. Allocated memory was 202.9 MB in the beginning and 467.7 MB in the end (delta: 264.8 MB). Free memory was 170.7 MB in the beginning and 294.1 MB in the end (delta: -123.4 MB). Peak memory consumption was 141.4 MB. Max. memory is 7.1 GB. [2020-08-19 00:20:21,326 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.27 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: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 261.30 ms. Allocated memory is still 140.5 MB. Free memory was 103.6 MB in the beginning and 94.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.02 ms. Allocated memory is still 140.5 MB. Free memory was 94.3 MB in the beginning and 93.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 324.26 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 93.0 MB in the beginning and 171.4 MB in the end (delta: -78.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13281.84 ms. Allocated memory was 202.9 MB in the beginning and 467.7 MB in the end (delta: 264.8 MB). Free memory was 170.7 MB in the beginning and 294.1 MB in the end (delta: -123.4 MB). Peak memory consumption was 141.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 20; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND TRUE n <= 0 [L5] return m + n; [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.1s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 243 SDtfs, 523 SDslu, 1120 SDs, 0 SdLazy, 809 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1533 NumberOfCodeBlocks, 1533 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 301200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/7600 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...