/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/fibo_2calls_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 00:19:10,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 00:19:10,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 00:19:10,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 00:19:10,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 00:19:10,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 00:19:10,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 00:19:10,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 00:19:10,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 00:19:10,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 00:19:10,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 00:19:10,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 00:19:10,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 00:19:10,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 00:19:10,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 00:19:10,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 00:19:10,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 00:19:10,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 00:19:10,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 00:19:10,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 00:19:10,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 00:19:10,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 00:19:10,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 00:19:10,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 00:19:10,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 00:19:10,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 00:19:10,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 00:19:10,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 00:19:10,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 00:19:10,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 00:19:10,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 00:19:10,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 00:19:10,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 00:19:10,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 00:19:10,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 00:19:10,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 00:19:10,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 00:19:10,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 00:19:10,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 00:19:10,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 00:19:10,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 00:19:10,338 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:19:10,381 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 00:19:10,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 00:19:10,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 00:19:10,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 00:19:10,384 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 00:19:10,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 00:19:10,385 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 00:19:10,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 00:19:10,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 00:19:10,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 00:19:10,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 00:19:10,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 00:19:10,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 00:19:10,387 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 00:19:10,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 00:19:10,388 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 00:19:10,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 00:19:10,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 00:19:10,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 00:19:10,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 00:19:10,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 00:19:10,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 00:19:10,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 00:19:10,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 00:19:10,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 00:19:10,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 00:19:10,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 00:19:10,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 00:19:10,390 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 00:19:10,390 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:19:10,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 00:19:10,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 00:19:10,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 00:19:10,704 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 00:19:10,705 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 00:19:10,705 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-08-19 00:19:10,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9c014b738/0985a14266c646cf81e4f29a2be2a8fc/FLAG72480ec9c [2020-08-19 00:19:11,212 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 00:19:11,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-08-19 00:19:11,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9c014b738/0985a14266c646cf81e4f29a2be2a8fc/FLAG72480ec9c [2020-08-19 00:19:11,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9c014b738/0985a14266c646cf81e4f29a2be2a8fc [2020-08-19 00:19:11,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 00:19:11,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 00:19:11,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 00:19:11,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 00:19:11,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 00:19:11,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 12:19:11" (1/1) ... [2020-08-19 00:19:11,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724e5b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11, skipping insertion in model container [2020-08-19 00:19:11,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 12:19:11" (1/1) ... [2020-08-19 00:19:11,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 00:19:11,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 00:19:11,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 00:19:11,893 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 00:19:11,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 00:19:11,923 INFO L208 MainTranslator]: Completed translation [2020-08-19 00:19:11,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11 WrapperNode [2020-08-19 00:19:11,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 00:19:11,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 00:19:11,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 00:19:11,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 00:19:11,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11" (1/1) ... [2020-08-19 00:19:11,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11" (1/1) ... [2020-08-19 00:19:12,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11" (1/1) ... [2020-08-19 00:19:12,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11" (1/1) ... [2020-08-19 00:19:12,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11" (1/1) ... [2020-08-19 00:19:12,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11" (1/1) ... [2020-08-19 00:19:12,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11" (1/1) ... [2020-08-19 00:19:12,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 00:19:12,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 00:19:12,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 00:19:12,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 00:19:12,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11" (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:19:12,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 00:19:12,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 00:19:12,098 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-08-19 00:19:12,098 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-08-19 00:19:12,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 00:19:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 00:19:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 00:19:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-08-19 00:19:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-08-19 00:19:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 00:19:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 00:19:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 00:19:12,289 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 00:19:12,289 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 00:19:12,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 12:19:12 BoogieIcfgContainer [2020-08-19 00:19:12,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 00:19:12,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 00:19:12,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 00:19:12,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 00:19:12,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 12:19:11" (1/3) ... [2020-08-19 00:19:12,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59712a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 12:19:12, skipping insertion in model container [2020-08-19 00:19:12,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:11" (2/3) ... [2020-08-19 00:19:12,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59712a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 12:19:12, skipping insertion in model container [2020-08-19 00:19:12,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 12:19:12" (3/3) ... [2020-08-19 00:19:12,303 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2020-08-19 00:19:12,314 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 00:19:12,322 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 00:19:12,337 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 00:19:12,363 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 00:19:12,364 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 00:19:12,364 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 00:19:12,364 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 00:19:12,364 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 00:19:12,364 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 00:19:12,364 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 00:19:12,364 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 00:19:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-08-19 00:19:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 00:19:12,387 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:12,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:12,389 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:12,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:12,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-08-19 00:19:12,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:12,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995576015] [2020-08-19 00:19:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:12,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:12,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:12,597 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:19:12,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995576015] [2020-08-19 00:19:12,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:19:12,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 00:19:12,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567775638] [2020-08-19 00:19:12,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 00:19:12,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:12,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 00:19:12,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 00:19:12,651 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-08-19 00:19:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:12,819 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-08-19 00:19:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 00:19:12,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 00:19:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:12,832 INFO L225 Difference]: With dead ends: 44 [2020-08-19 00:19:12,832 INFO L226 Difference]: Without dead ends: 30 [2020-08-19 00:19:12,836 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:19:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-19 00:19:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-19 00:19:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-19 00:19:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-08-19 00:19:12,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-08-19 00:19:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:12,883 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-08-19 00:19:12,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 00:19:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-08-19 00:19:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 00:19:12,885 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:12,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:12,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 00:19:12,886 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-08-19 00:19:12,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:12,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730993347] [2020-08-19 00:19:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:12,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:12,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:12,967 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:19:12,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730993347] [2020-08-19 00:19:12,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:19:12,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 00:19:12,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911157857] [2020-08-19 00:19:12,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 00:19:12,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:12,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 00:19:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 00:19:12,972 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-08-19 00:19:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:13,043 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-08-19 00:19:13,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 00:19:13,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 00:19:13,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:13,045 INFO L225 Difference]: With dead ends: 36 [2020-08-19 00:19:13,045 INFO L226 Difference]: Without dead ends: 32 [2020-08-19 00:19:13,047 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:19:13,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-08-19 00:19:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-08-19 00:19:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-19 00:19:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-08-19 00:19:13,057 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-08-19 00:19:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:13,057 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-08-19 00:19:13,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 00:19:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-08-19 00:19:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 00:19:13,059 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:13,060 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:13,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 00:19:13,060 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-08-19 00:19:13,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:13,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1333394061] [2020-08-19 00:19:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 00:19:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-19 00:19:13,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1333394061] [2020-08-19 00:19:13,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:13,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 00:19:13,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579018142] [2020-08-19 00:19:13,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 00:19:13,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:13,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 00:19:13,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:19:13,229 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2020-08-19 00:19:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:13,310 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-08-19 00:19:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 00:19:13,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-19 00:19:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:13,312 INFO L225 Difference]: With dead ends: 58 [2020-08-19 00:19:13,313 INFO L226 Difference]: Without dead ends: 34 [2020-08-19 00:19:13,314 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-08-19 00:19:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-08-19 00:19:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-08-19 00:19:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-08-19 00:19:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-08-19 00:19:13,324 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-08-19 00:19:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:13,325 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-08-19 00:19:13,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 00:19:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-08-19 00:19:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 00:19:13,327 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:13,327 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:13,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 00:19:13,328 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:13,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-08-19 00:19:13,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:13,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908358542] [2020-08-19 00:19:13,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-19 00:19:13,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908358542] [2020-08-19 00:19:13,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:13,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 00:19:13,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658881753] [2020-08-19 00:19:13,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 00:19:13,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:13,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 00:19:13,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:19:13,436 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2020-08-19 00:19:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:13,624 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-08-19 00:19:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 00:19:13,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-08-19 00:19:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:13,628 INFO L225 Difference]: With dead ends: 54 [2020-08-19 00:19:13,628 INFO L226 Difference]: Without dead ends: 50 [2020-08-19 00:19:13,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-19 00:19:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-08-19 00:19:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-08-19 00:19:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-19 00:19:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-08-19 00:19:13,643 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-08-19 00:19:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:13,643 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-08-19 00:19:13,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 00:19:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-08-19 00:19:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-08-19 00:19:13,646 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:13,646 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:13,646 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 00:19:13,646 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:13,647 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-08-19 00:19:13,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:13,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [405221380] [2020-08-19 00:19:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 00:19:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-19 00:19:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-19 00:19:13,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [405221380] [2020-08-19 00:19:13,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:13,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 00:19:13,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265222866] [2020-08-19 00:19:13,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 00:19:13,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:13,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 00:19:13,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 00:19:13,805 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2020-08-19 00:19:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:13,880 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2020-08-19 00:19:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 00:19:13,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-08-19 00:19:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:13,883 INFO L225 Difference]: With dead ends: 94 [2020-08-19 00:19:13,883 INFO L226 Difference]: Without dead ends: 52 [2020-08-19 00:19:13,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:19:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-08-19 00:19:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-08-19 00:19:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-08-19 00:19:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2020-08-19 00:19:13,898 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 39 [2020-08-19 00:19:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:13,898 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2020-08-19 00:19:13,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 00:19:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2020-08-19 00:19:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 00:19:13,901 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:13,901 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:13,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 00:19:13,901 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-08-19 00:19:13,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:13,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [217101870] [2020-08-19 00:19:13,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:13,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-19 00:19:14,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [217101870] [2020-08-19 00:19:14,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:14,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 00:19:14,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749242110] [2020-08-19 00:19:14,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 00:19:14,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:14,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 00:19:14,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-19 00:19:14,039 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 8 states. [2020-08-19 00:19:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:14,154 INFO L93 Difference]: Finished difference Result 103 states and 158 transitions. [2020-08-19 00:19:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 00:19:14,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-19 00:19:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:14,157 INFO L225 Difference]: With dead ends: 103 [2020-08-19 00:19:14,157 INFO L226 Difference]: Without dead ends: 57 [2020-08-19 00:19:14,158 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:19:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-19 00:19:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-19 00:19:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-19 00:19:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2020-08-19 00:19:14,170 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 40 [2020-08-19 00:19:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:14,170 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2020-08-19 00:19:14,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 00:19:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2020-08-19 00:19:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 00:19:14,173 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:14,173 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:14,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 00:19:14,174 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:14,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash 208191613, now seen corresponding path program 1 times [2020-08-19 00:19:14,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:14,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [298709704] [2020-08-19 00:19:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-19 00:19:14,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [298709704] [2020-08-19 00:19:14,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:14,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 00:19:14,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944118279] [2020-08-19 00:19:14,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 00:19:14,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:14,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 00:19:14,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-19 00:19:14,324 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand 8 states. [2020-08-19 00:19:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:14,514 INFO L93 Difference]: Finished difference Result 86 states and 126 transitions. [2020-08-19 00:19:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 00:19:14,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-08-19 00:19:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:14,517 INFO L225 Difference]: With dead ends: 86 [2020-08-19 00:19:14,517 INFO L226 Difference]: Without dead ends: 82 [2020-08-19 00:19:14,518 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-08-19 00:19:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-08-19 00:19:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2020-08-19 00:19:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-08-19 00:19:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2020-08-19 00:19:14,536 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 41 [2020-08-19 00:19:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:14,537 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2020-08-19 00:19:14,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 00:19:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2020-08-19 00:19:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-19 00:19:14,541 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:14,541 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:14,541 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 00:19:14,541 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:14,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-08-19 00:19:14,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:14,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2031231156] [2020-08-19 00:19:14,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-19 00:19:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-08-19 00:19:14,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2031231156] [2020-08-19 00:19:14,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:14,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 00:19:14,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645125858] [2020-08-19 00:19:14,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 00:19:14,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:14,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 00:19:14,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-19 00:19:14,786 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand 8 states. [2020-08-19 00:19:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:14,940 INFO L93 Difference]: Finished difference Result 167 states and 288 transitions. [2020-08-19 00:19:14,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 00:19:14,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-08-19 00:19:14,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:14,946 INFO L225 Difference]: With dead ends: 167 [2020-08-19 00:19:14,948 INFO L226 Difference]: Without dead ends: 94 [2020-08-19 00:19:14,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:19:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-19 00:19:14,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2020-08-19 00:19:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-08-19 00:19:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2020-08-19 00:19:14,988 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 54 [2020-08-19 00:19:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:14,989 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 134 transitions. [2020-08-19 00:19:14,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 00:19:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2020-08-19 00:19:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-19 00:19:14,996 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:14,996 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:14,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 00:19:14,997 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2020-08-19 00:19:14,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:14,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1847203537] [2020-08-19 00:19:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-08-19 00:19:15,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1847203537] [2020-08-19 00:19:15,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:15,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 00:19:15,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57888125] [2020-08-19 00:19:15,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:19:15,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:15,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:19:15,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:19:15,192 INFO L87 Difference]: Start difference. First operand 88 states and 134 transitions. Second operand 10 states. [2020-08-19 00:19:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:15,459 INFO L93 Difference]: Finished difference Result 188 states and 331 transitions. [2020-08-19 00:19:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 00:19:15,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-08-19 00:19:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:15,463 INFO L225 Difference]: With dead ends: 188 [2020-08-19 00:19:15,463 INFO L226 Difference]: Without dead ends: 109 [2020-08-19 00:19:15,465 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-08-19 00:19:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-08-19 00:19:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2020-08-19 00:19:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-08-19 00:19:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2020-08-19 00:19:15,499 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 55 [2020-08-19 00:19:15,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:15,500 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2020-08-19 00:19:15,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:19:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2020-08-19 00:19:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-19 00:19:15,505 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:15,505 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:15,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 00:19:15,505 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:15,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:15,506 INFO L82 PathProgramCache]: Analyzing trace with hash -908952008, now seen corresponding path program 2 times [2020-08-19 00:19:15,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:15,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1594917582] [2020-08-19 00:19:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 30 proven. 52 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-08-19 00:19:15,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1594917582] [2020-08-19 00:19:15,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:15,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 00:19:15,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826356642] [2020-08-19 00:19:15,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 00:19:15,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:15,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 00:19:15,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-19 00:19:15,838 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 12 states. [2020-08-19 00:19:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:16,200 INFO L93 Difference]: Finished difference Result 199 states and 354 transitions. [2020-08-19 00:19:16,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-19 00:19:16,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2020-08-19 00:19:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:16,202 INFO L225 Difference]: With dead ends: 199 [2020-08-19 00:19:16,202 INFO L226 Difference]: Without dead ends: 86 [2020-08-19 00:19:16,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-08-19 00:19:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-08-19 00:19:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2020-08-19 00:19:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-19 00:19:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2020-08-19 00:19:16,217 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 82 [2020-08-19 00:19:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:16,218 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2020-08-19 00:19:16,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 00:19:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2020-08-19 00:19:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-08-19 00:19:16,219 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:16,220 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:16,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 00:19:16,220 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:16,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:16,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1156896337, now seen corresponding path program 1 times [2020-08-19 00:19:16,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:16,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1666080366] [2020-08-19 00:19:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-08-19 00:19:16,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1666080366] [2020-08-19 00:19:16,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:16,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-19 00:19:16,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409186535] [2020-08-19 00:19:16,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-19 00:19:16,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:16,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-19 00:19:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-08-19 00:19:16,573 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand 17 states. [2020-08-19 00:19:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:16,780 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2020-08-19 00:19:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-19 00:19:16,781 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2020-08-19 00:19:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:16,782 INFO L225 Difference]: With dead ends: 96 [2020-08-19 00:19:16,782 INFO L226 Difference]: Without dead ends: 92 [2020-08-19 00:19:16,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2020-08-19 00:19:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-08-19 00:19:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2020-08-19 00:19:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-08-19 00:19:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2020-08-19 00:19:16,792 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 68 [2020-08-19 00:19:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:16,792 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2020-08-19 00:19:16,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-19 00:19:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2020-08-19 00:19:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-08-19 00:19:16,793 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:16,794 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:16,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 00:19:16,794 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1711191765, now seen corresponding path program 2 times [2020-08-19 00:19:16,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:16,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1398436392] [2020-08-19 00:19:16,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-19 00:19:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-08-19 00:19:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-08-19 00:19:16,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1398436392] [2020-08-19 00:19:16,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:16,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 00:19:16,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354613089] [2020-08-19 00:19:16,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 00:19:16,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:16,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 00:19:16,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:19:16,891 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand 7 states. [2020-08-19 00:19:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:16,979 INFO L93 Difference]: Finished difference Result 143 states and 199 transitions. [2020-08-19 00:19:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 00:19:16,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2020-08-19 00:19:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:16,981 INFO L225 Difference]: With dead ends: 143 [2020-08-19 00:19:16,981 INFO L226 Difference]: Without dead ends: 70 [2020-08-19 00:19:16,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:19:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-19 00:19:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-08-19 00:19:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-19 00:19:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2020-08-19 00:19:16,988 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 69 [2020-08-19 00:19:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:16,989 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2020-08-19 00:19:16,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 00:19:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2020-08-19 00:19:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-08-19 00:19:16,991 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:16,991 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:16,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 00:19:16,991 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:16,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:16,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2119203654, now seen corresponding path program 3 times [2020-08-19 00:19:16,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:16,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122913648] [2020-08-19 00:19:16,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-19 00:19:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-08-19 00:19:17,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122913648] [2020-08-19 00:19:17,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:17,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 00:19:17,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571549536] [2020-08-19 00:19:17,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:19:17,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:17,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:19:17,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:19:17,250 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand 10 states. [2020-08-19 00:19:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:17,432 INFO L93 Difference]: Finished difference Result 131 states and 175 transitions. [2020-08-19 00:19:17,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 00:19:17,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2020-08-19 00:19:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:17,434 INFO L225 Difference]: With dead ends: 131 [2020-08-19 00:19:17,434 INFO L226 Difference]: Without dead ends: 70 [2020-08-19 00:19:17,435 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-08-19 00:19:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-19 00:19:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-08-19 00:19:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-19 00:19:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-08-19 00:19:17,442 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 110 [2020-08-19 00:19:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:17,443 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-08-19 00:19:17,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:19:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-08-19 00:19:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-19 00:19:17,445 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:17,445 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:17,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 00:19:17,445 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2011292190, now seen corresponding path program 2 times [2020-08-19 00:19:17,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:17,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [949275850] [2020-08-19 00:19:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 00:19:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 40 proven. 124 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-08-19 00:19:17,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [949275850] [2020-08-19 00:19:17,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:17,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 00:19:17,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425931361] [2020-08-19 00:19:17,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:19:17,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:19:17,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:19:17,730 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 10 states. [2020-08-19 00:19:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:17,988 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2020-08-19 00:19:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 00:19:17,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 136 [2020-08-19 00:19:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:17,990 INFO L225 Difference]: With dead ends: 77 [2020-08-19 00:19:17,990 INFO L226 Difference]: Without dead ends: 0 [2020-08-19 00:19:17,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-08-19 00:19:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-19 00:19:17,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-19 00:19:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-19 00:19:17,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-19 00:19:17,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2020-08-19 00:19:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:17,992 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-19 00:19:17,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:19:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-19 00:19:17,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-19 00:19:17,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-19 00:19:17,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-19 00:19:18,354 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 15 [2020-08-19 00:19:18,536 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-08-19 00:19:18,542 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-19 00:19:18,542 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-19 00:19:18,542 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-19 00:19:18,542 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-19 00:19:18,542 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-19 00:19:18,542 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-19 00:19:18,543 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2020-08-19 00:19:18,543 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-08-19 00:19:18,543 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 35 42) no Hoare annotation was computed. [2020-08-19 00:19:18,543 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 35 42) no Hoare annotation was computed. [2020-08-19 00:19:18,543 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-08-19 00:19:18,543 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-08-19 00:19:18,544 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~x~0 4)) [2020-08-19 00:19:18,544 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-08-19 00:19:18,544 INFO L268 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2020-08-19 00:19:18,544 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-08-19 00:19:18,546 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-08-19 00:19:18,546 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-08-19 00:19:18,547 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) .cse0))) [2020-08-19 00:19:18,547 INFO L268 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2020-08-19 00:19:18,547 INFO L268 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2020-08-19 00:19:18,547 INFO L268 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2020-08-19 00:19:18,547 INFO L268 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2020-08-19 00:19:18,547 INFO L268 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2020-08-19 00:19:18,547 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-08-19 00:19:18,548 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-08-19 00:19:18,548 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-08-19 00:19:18,548 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) .cse0) (and (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2)) (or (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|)) (<= 4 fibo1_~n))) [2020-08-19 00:19:18,548 INFO L268 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2020-08-19 00:19:18,548 INFO L268 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2020-08-19 00:19:18,549 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-08-19 00:19:18,549 INFO L268 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2020-08-19 00:19:18,549 INFO L268 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2020-08-19 00:19:18,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 12:19:18 BoogieIcfgContainer [2020-08-19 00:19:18,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 00:19:18,563 INFO L168 Benchmark]: Toolchain (without parser) took 6907.61 ms. Allocated memory was 140.0 MB in the beginning and 317.7 MB in the end (delta: 177.7 MB). Free memory was 103.2 MB in the beginning and 141.2 MB in the end (delta: -38.0 MB). Peak memory consumption was 139.7 MB. Max. memory is 7.1 GB. [2020-08-19 00:19:18,563 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-08-19 00:19:18,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.62 ms. Allocated memory is still 140.0 MB. Free memory was 102.8 MB in the beginning and 93.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-08-19 00:19:18,567 INFO L168 Benchmark]: Boogie Preprocessor took 105.04 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 93.2 MB in the beginning and 181.5 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-19 00:19:18,574 INFO L168 Benchmark]: RCFGBuilder took 263.67 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 168.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-08-19 00:19:18,576 INFO L168 Benchmark]: TraceAbstraction took 6262.68 ms. Allocated memory was 203.4 MB in the beginning and 317.7 MB in the end (delta: 114.3 MB). Free memory was 168.3 MB in the beginning and 141.2 MB in the end (delta: 27.2 MB). Peak memory consumption was 141.5 MB. Max. memory is 7.1 GB. [2020-08-19 00:19:18,584 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.23 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 271.62 ms. Allocated memory is still 140.0 MB. Free memory was 102.8 MB in the beginning and 93.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.04 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 93.2 MB in the beginning and 181.5 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 263.67 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 168.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6262.68 ms. Allocated memory was 203.4 MB in the beginning and 317.7 MB in the end (delta: 114.3 MB). Free memory was 168.3 MB in the beginning and 141.2 MB in the end (delta: 27.2 MB). Peak memory consumption was 141.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.6s, OverallIterations: 14, TraceHistogramMax: 10, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 436 SDtfs, 293 SDslu, 2109 SDs, 0 SdLazy, 1553 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 48 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 344 PreInvPairs, 398 NumberOfFragments, 94 HoareAnnotationTreeSize, 344 FomulaSimplifications, 448 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 11 FomulaSimplificationsInter, 770 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 103564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 816/1159 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 correct! Received shutdown request...