/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_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 00:19:22,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 00:19:22,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 00:19:22,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 00:19:22,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 00:19:22,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 00:19:22,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 00:19:22,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 00:19:22,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 00:19:22,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 00:19:22,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 00:19:22,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 00:19:22,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 00:19:22,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 00:19:22,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 00:19:22,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 00:19:22,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 00:19:22,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 00:19:22,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 00:19:22,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 00:19:22,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 00:19:22,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 00:19:22,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 00:19:22,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 00:19:22,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 00:19:22,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 00:19:22,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 00:19:22,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 00:19:22,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 00:19:22,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 00:19:22,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 00:19:22,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 00:19:22,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 00:19:22,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 00:19:22,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 00:19:22,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 00:19:22,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 00:19:22,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 00:19:22,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 00:19:22,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 00:19:22,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 00:19:22,510 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:22,551 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 00:19:22,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 00:19:22,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 00:19:22,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 00:19:22,554 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 00:19:22,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 00:19:22,554 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 00:19:22,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 00:19:22,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 00:19:22,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 00:19:22,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 00:19:22,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 00:19:22,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 00:19:22,557 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 00:19:22,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 00:19:22,557 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 00:19:22,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 00:19:22,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 00:19:22,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 00:19:22,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 00:19:22,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 00:19:22,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 00:19:22,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 00:19:22,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 00:19:22,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 00:19:22,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 00:19:22,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 00:19:22,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 00:19:22,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 00:19:22,560 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:22,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 00:19:22,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 00:19:22,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 00:19:22,874 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 00:19:22,874 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 00:19:22,875 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-08-19 00:19:22,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/471154be6/ef0e060f67a54e7eb85d785cf322ef65/FLAGa3d4a4f94 [2020-08-19 00:19:23,394 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 00:19:23,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-08-19 00:19:23,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/471154be6/ef0e060f67a54e7eb85d785cf322ef65/FLAGa3d4a4f94 [2020-08-19 00:19:23,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/471154be6/ef0e060f67a54e7eb85d785cf322ef65 [2020-08-19 00:19:23,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 00:19:23,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 00:19:23,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 00:19:23,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 00:19:23,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 00:19:23,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 12:19:23" (1/1) ... [2020-08-19 00:19:23,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2230d16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:23, skipping insertion in model container [2020-08-19 00:19:23,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 12:19:23" (1/1) ... [2020-08-19 00:19:23,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 00:19:23,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 00:19:24,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 00:19:24,022 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 00:19:24,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 00:19:24,046 INFO L208 MainTranslator]: Completed translation [2020-08-19 00:19:24,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:24 WrapperNode [2020-08-19 00:19:24,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 00:19:24,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 00:19:24,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 00:19:24,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 00:19:24,057 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:24" (1/1) ... [2020-08-19 00:19:24,058 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:24" (1/1) ... [2020-08-19 00:19:24,132 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:24" (1/1) ... [2020-08-19 00:19:24,133 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:24" (1/1) ... [2020-08-19 00:19:24,138 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:24" (1/1) ... [2020-08-19 00:19:24,142 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:24" (1/1) ... [2020-08-19 00:19:24,145 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:24" (1/1) ... [2020-08-19 00:19:24,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 00:19:24,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 00:19:24,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 00:19:24,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 00:19:24,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:24" (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:24,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 00:19:24,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 00:19:24,206 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-08-19 00:19:24,206 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-08-19 00:19:24,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 00:19:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 00:19:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 00:19:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-08-19 00:19:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-08-19 00:19:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 00:19:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 00:19:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 00:19:24,399 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 00:19:24,399 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 00:19:24,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 12:19:24 BoogieIcfgContainer [2020-08-19 00:19:24,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 00:19:24,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 00:19:24,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 00:19:24,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 00:19:24,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 12:19:23" (1/3) ... [2020-08-19 00:19:24,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b344c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 12:19:24, skipping insertion in model container [2020-08-19 00:19:24,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:24" (2/3) ... [2020-08-19 00:19:24,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b344c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 12:19:24, skipping insertion in model container [2020-08-19 00:19:24,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 12:19:24" (3/3) ... [2020-08-19 00:19:24,412 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-08-19 00:19:24,423 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 00:19:24,431 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 00:19:24,448 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 00:19:24,479 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 00:19:24,479 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 00:19:24,479 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 00:19:24,480 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 00:19:24,480 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 00:19:24,480 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 00:19:24,480 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 00:19:24,480 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 00:19:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-08-19 00:19:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 00:19:24,514 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:24,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:24,516 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:24,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-08-19 00:19:24,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:24,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51165319] [2020-08-19 00:19:24,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:24,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:24,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:24,728 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:24,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [51165319] [2020-08-19 00:19:24,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:19:24,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 00:19:24,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133846704] [2020-08-19 00:19:24,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 00:19:24,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 00:19:24,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 00:19:24,754 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-08-19 00:19:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:24,866 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-08-19 00:19:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 00:19:24,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 00:19:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:24,880 INFO L225 Difference]: With dead ends: 44 [2020-08-19 00:19:24,881 INFO L226 Difference]: Without dead ends: 30 [2020-08-19 00:19:24,884 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:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-19 00:19:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-19 00:19:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-19 00:19:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-08-19 00:19:24,931 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-08-19 00:19:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:24,931 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-08-19 00:19:24,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 00:19:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-08-19 00:19:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 00:19:24,933 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:24,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:24,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 00:19:24,935 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:24,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:24,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-08-19 00:19:24,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:24,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1128532611] [2020-08-19 00:19:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:24,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:24,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:24,998 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:24,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1128532611] [2020-08-19 00:19:25,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:19:25,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 00:19:25,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434527707] [2020-08-19 00:19:25,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 00:19:25,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:25,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 00:19:25,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 00:19:25,004 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-08-19 00:19:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:25,067 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-08-19 00:19:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 00:19:25,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 00:19:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:25,070 INFO L225 Difference]: With dead ends: 36 [2020-08-19 00:19:25,070 INFO L226 Difference]: Without dead ends: 32 [2020-08-19 00:19:25,072 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:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-08-19 00:19:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-08-19 00:19:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-19 00:19:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-08-19 00:19:25,081 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-08-19 00:19:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:25,082 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-08-19 00:19:25,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 00:19:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-08-19 00:19:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 00:19:25,084 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:25,084 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:25,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 00:19:25,085 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-08-19 00:19:25,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:25,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1603581387] [2020-08-19 00:19:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 00:19:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,229 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:25,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1603581387] [2020-08-19 00:19:25,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:25,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 00:19:25,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594866149] [2020-08-19 00:19:25,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 00:19:25,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:25,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 00:19:25,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:19:25,232 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2020-08-19 00:19:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:25,352 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-08-19 00:19:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 00:19:25,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-19 00:19:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:25,354 INFO L225 Difference]: With dead ends: 58 [2020-08-19 00:19:25,355 INFO L226 Difference]: Without dead ends: 34 [2020-08-19 00:19:25,358 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:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-08-19 00:19:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-08-19 00:19:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-08-19 00:19:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-08-19 00:19:25,372 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-08-19 00:19:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:25,373 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-08-19 00:19:25,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 00:19:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-08-19 00:19:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 00:19:25,375 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:25,375 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:25,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 00:19:25,376 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:25,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:25,376 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-08-19 00:19:25,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:25,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2033256347] [2020-08-19 00:19:25,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,486 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:25,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2033256347] [2020-08-19 00:19:25,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:25,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 00:19:25,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229638400] [2020-08-19 00:19:25,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 00:19:25,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:25,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 00:19:25,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:19:25,489 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2020-08-19 00:19:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:25,702 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-08-19 00:19:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 00:19:25,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-08-19 00:19:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:25,709 INFO L225 Difference]: With dead ends: 54 [2020-08-19 00:19:25,709 INFO L226 Difference]: Without dead ends: 50 [2020-08-19 00:19:25,710 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:25,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-08-19 00:19:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-08-19 00:19:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-19 00:19:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-08-19 00:19:25,727 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-08-19 00:19:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:25,727 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-08-19 00:19:25,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 00:19:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-08-19 00:19:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-08-19 00:19:25,732 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:25,732 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:25,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 00:19:25,733 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:25,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:25,733 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-08-19 00:19:25,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:25,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [961764421] [2020-08-19 00:19:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 00:19:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-19 00:19:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:25,884 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:25,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [961764421] [2020-08-19 00:19:25,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:25,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 00:19:25,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703358601] [2020-08-19 00:19:25,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 00:19:25,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:25,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 00:19:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 00:19:25,886 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2020-08-19 00:19:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:25,972 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2020-08-19 00:19:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 00:19:25,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-08-19 00:19:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:25,974 INFO L225 Difference]: With dead ends: 94 [2020-08-19 00:19:25,974 INFO L226 Difference]: Without dead ends: 52 [2020-08-19 00:19:25,976 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:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-08-19 00:19:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-08-19 00:19:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-08-19 00:19:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2020-08-19 00:19:25,987 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 39 [2020-08-19 00:19:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:25,988 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2020-08-19 00:19:25,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 00:19:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2020-08-19 00:19:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 00:19:25,990 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:25,990 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:25,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 00:19:25,991 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:25,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-08-19 00:19:25,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:25,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [149723262] [2020-08-19 00:19:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,119 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:26,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [149723262] [2020-08-19 00:19:26,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:26,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 00:19:26,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743544803] [2020-08-19 00:19:26,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 00:19:26,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:26,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 00:19:26,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-19 00:19:26,122 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 8 states. [2020-08-19 00:19:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:26,230 INFO L93 Difference]: Finished difference Result 103 states and 158 transitions. [2020-08-19 00:19:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 00:19:26,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-19 00:19:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:26,233 INFO L225 Difference]: With dead ends: 103 [2020-08-19 00:19:26,233 INFO L226 Difference]: Without dead ends: 57 [2020-08-19 00:19:26,234 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:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-19 00:19:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-19 00:19:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-19 00:19:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2020-08-19 00:19:26,246 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 40 [2020-08-19 00:19:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:26,246 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2020-08-19 00:19:26,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 00:19:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2020-08-19 00:19:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 00:19:26,248 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:26,249 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:26,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 00:19:26,249 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash 208191613, now seen corresponding path program 1 times [2020-08-19 00:19:26,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:26,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178582773] [2020-08-19 00:19:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,423 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:26,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178582773] [2020-08-19 00:19:26,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:26,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 00:19:26,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148674673] [2020-08-19 00:19:26,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 00:19:26,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:26,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 00:19:26,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-19 00:19:26,425 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand 8 states. [2020-08-19 00:19:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:26,616 INFO L93 Difference]: Finished difference Result 86 states and 126 transitions. [2020-08-19 00:19:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 00:19:26,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-08-19 00:19:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:26,619 INFO L225 Difference]: With dead ends: 86 [2020-08-19 00:19:26,620 INFO L226 Difference]: Without dead ends: 82 [2020-08-19 00:19:26,621 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:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-08-19 00:19:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2020-08-19 00:19:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-08-19 00:19:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2020-08-19 00:19:26,637 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 41 [2020-08-19 00:19:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:26,637 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2020-08-19 00:19:26,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 00:19:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2020-08-19 00:19:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-19 00:19:26,641 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:26,650 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:26,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 00:19:26,651 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:26,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:26,654 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-08-19 00:19:26,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:26,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178593801] [2020-08-19 00:19:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-19 00:19:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:26,857 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:26,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178593801] [2020-08-19 00:19:26,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:26,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 00:19:26,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252308680] [2020-08-19 00:19:26,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 00:19:26,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:26,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 00:19:26,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-19 00:19:26,860 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand 8 states. [2020-08-19 00:19:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:26,973 INFO L93 Difference]: Finished difference Result 167 states and 288 transitions. [2020-08-19 00:19:26,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 00:19:26,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-08-19 00:19:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:26,975 INFO L225 Difference]: With dead ends: 167 [2020-08-19 00:19:26,976 INFO L226 Difference]: Without dead ends: 94 [2020-08-19 00:19:26,977 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:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-19 00:19:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2020-08-19 00:19:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-08-19 00:19:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2020-08-19 00:19:26,993 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 54 [2020-08-19 00:19:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:26,994 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 134 transitions. [2020-08-19 00:19:26,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 00:19:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2020-08-19 00:19:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-19 00:19:26,997 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:26,997 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:26,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 00:19:26,997 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:26,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:26,998 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2020-08-19 00:19:26,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:26,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1089117735] [2020-08-19 00:19:26,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,172 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:27,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1089117735] [2020-08-19 00:19:27,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:27,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 00:19:27,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497226758] [2020-08-19 00:19:27,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:19:27,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:27,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:19:27,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:19:27,180 INFO L87 Difference]: Start difference. First operand 88 states and 134 transitions. Second operand 10 states. [2020-08-19 00:19:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:27,402 INFO L93 Difference]: Finished difference Result 188 states and 331 transitions. [2020-08-19 00:19:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 00:19:27,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-08-19 00:19:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:27,404 INFO L225 Difference]: With dead ends: 188 [2020-08-19 00:19:27,404 INFO L226 Difference]: Without dead ends: 109 [2020-08-19 00:19:27,406 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:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-08-19 00:19:27,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2020-08-19 00:19:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-08-19 00:19:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2020-08-19 00:19:27,441 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 55 [2020-08-19 00:19:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:27,442 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2020-08-19 00:19:27,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:19:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2020-08-19 00:19:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-19 00:19:27,449 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:27,449 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:27,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 00:19:27,449 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:27,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash -908952008, now seen corresponding path program 2 times [2020-08-19 00:19:27,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:27,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376177146] [2020-08-19 00:19:27,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:27,688 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:27,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376177146] [2020-08-19 00:19:27,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:27,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 00:19:27,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69644073] [2020-08-19 00:19:27,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 00:19:27,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:27,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 00:19:27,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-19 00:19:27,691 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 12 states. [2020-08-19 00:19:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:28,046 INFO L93 Difference]: Finished difference Result 199 states and 354 transitions. [2020-08-19 00:19:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-19 00:19:28,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2020-08-19 00:19:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:28,050 INFO L225 Difference]: With dead ends: 199 [2020-08-19 00:19:28,050 INFO L226 Difference]: Without dead ends: 86 [2020-08-19 00:19:28,052 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-08-19 00:19:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-08-19 00:19:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2020-08-19 00:19:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-08-19 00:19:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2020-08-19 00:19:28,060 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 82 [2020-08-19 00:19:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:28,060 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-08-19 00:19:28,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 00:19:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2020-08-19 00:19:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-08-19 00:19:28,062 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:28,062 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:28,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 00:19:28,062 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:28,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:28,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2119203654, now seen corresponding path program 2 times [2020-08-19 00:19:28,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:28,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2115461175] [2020-08-19 00:19:28,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-19 00:19:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,292 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:28,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2115461175] [2020-08-19 00:19:28,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:28,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 00:19:28,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323258243] [2020-08-19 00:19:28,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:19:28,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:28,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:19:28,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:19:28,295 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand 10 states. [2020-08-19 00:19:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:28,458 INFO L93 Difference]: Finished difference Result 142 states and 204 transitions. [2020-08-19 00:19:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 00:19:28,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2020-08-19 00:19:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:28,460 INFO L225 Difference]: With dead ends: 142 [2020-08-19 00:19:28,460 INFO L226 Difference]: Without dead ends: 78 [2020-08-19 00:19:28,461 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:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-08-19 00:19:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-08-19 00:19:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-08-19 00:19:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2020-08-19 00:19:28,469 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 110 [2020-08-19 00:19:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:28,469 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2020-08-19 00:19:28,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:19:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2020-08-19 00:19:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-08-19 00:19:28,471 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:28,471 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 13, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:28,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 00:19:28,472 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:28,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:28,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1263382818, now seen corresponding path program 3 times [2020-08-19 00:19:28,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:28,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2015305997] [2020-08-19 00:19:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-19 00:19:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-19 00:19:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-19 00:19:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 133 proven. 373 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2020-08-19 00:19:28,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2015305997] [2020-08-19 00:19:28,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:28,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-19 00:19:28,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175559331] [2020-08-19 00:19:28,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-19 00:19:28,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:28,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-19 00:19:28,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-08-19 00:19:28,978 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 15 states. [2020-08-19 00:19:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:29,519 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2020-08-19 00:19:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-08-19 00:19:29,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 192 [2020-08-19 00:19:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:29,521 INFO L225 Difference]: With dead ends: 184 [2020-08-19 00:19:29,522 INFO L226 Difference]: Without dead ends: 111 [2020-08-19 00:19:29,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2020-08-19 00:19:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-08-19 00:19:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2020-08-19 00:19:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-08-19 00:19:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2020-08-19 00:19:29,538 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 192 [2020-08-19 00:19:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:29,539 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2020-08-19 00:19:29,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-19 00:19:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2020-08-19 00:19:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-19 00:19:29,545 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:29,545 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, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:29,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 00:19:29,546 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:29,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:29,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2102107778, now seen corresponding path program 1 times [2020-08-19 00:19:29,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:29,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [589293019] [2020-08-19 00:19:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 00:19:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-08-19 00:19:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 109 proven. 85 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2020-08-19 00:19:29,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [589293019] [2020-08-19 00:19:29,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:29,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 00:19:29,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189687036] [2020-08-19 00:19:29,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 00:19:29,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:29,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 00:19:29,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-08-19 00:19:29,909 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand 11 states. [2020-08-19 00:19:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:30,231 INFO L93 Difference]: Finished difference Result 188 states and 266 transitions. [2020-08-19 00:19:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-19 00:19:30,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2020-08-19 00:19:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:30,235 INFO L225 Difference]: With dead ends: 188 [2020-08-19 00:19:30,235 INFO L226 Difference]: Without dead ends: 101 [2020-08-19 00:19:30,236 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-08-19 00:19:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-08-19 00:19:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2020-08-19 00:19:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-08-19 00:19:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 130 transitions. [2020-08-19 00:19:30,250 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 130 transitions. Word has length 136 [2020-08-19 00:19:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:30,251 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 130 transitions. [2020-08-19 00:19:30,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 00:19:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 130 transitions. [2020-08-19 00:19:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 00:19:30,254 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:30,254 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:30,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 00:19:30,254 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash 677703633, now seen corresponding path program 2 times [2020-08-19 00:19:30,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:30,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1799030841] [2020-08-19 00:19:30,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 00:19:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-08-19 00:19:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 138 proven. 250 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2020-08-19 00:19:30,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1799030841] [2020-08-19 00:19:30,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:30,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-19 00:19:30,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061185428] [2020-08-19 00:19:30,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-19 00:19:30,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:30,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-19 00:19:30,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-08-19 00:19:30,690 INFO L87 Difference]: Start difference. First operand 98 states and 130 transitions. Second operand 14 states. [2020-08-19 00:19:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:31,190 INFO L93 Difference]: Finished difference Result 217 states and 326 transitions. [2020-08-19 00:19:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-19 00:19:31,190 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 177 [2020-08-19 00:19:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:31,192 INFO L225 Difference]: With dead ends: 217 [2020-08-19 00:19:31,192 INFO L226 Difference]: Without dead ends: 124 [2020-08-19 00:19:31,194 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-08-19 00:19:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-08-19 00:19:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2020-08-19 00:19:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-08-19 00:19:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 144 transitions. [2020-08-19 00:19:31,206 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 144 transitions. Word has length 177 [2020-08-19 00:19:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:31,207 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 144 transitions. [2020-08-19 00:19:31,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-19 00:19:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 144 transitions. [2020-08-19 00:19:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-19 00:19:31,209 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:31,209 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:31,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-19 00:19:31,210 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:31,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash -529934979, now seen corresponding path program 3 times [2020-08-19 00:19:31,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:31,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340671123] [2020-08-19 00:19:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:19:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:19:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 00:19:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 00:19:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 00:19:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:19:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:19:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 00:19:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:19:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 139 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-08-19 00:19:31,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340671123] [2020-08-19 00:19:31,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:19:31,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-19 00:19:31,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69391593] [2020-08-19 00:19:31,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-19 00:19:31,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:19:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-19 00:19:31,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-08-19 00:19:31,570 INFO L87 Difference]: Start difference. First operand 107 states and 144 transitions. Second operand 14 states. [2020-08-19 00:19:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:19:31,980 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2020-08-19 00:19:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-19 00:19:31,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 150 [2020-08-19 00:19:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:19:31,982 INFO L225 Difference]: With dead ends: 211 [2020-08-19 00:19:31,983 INFO L226 Difference]: Without dead ends: 114 [2020-08-19 00:19:31,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2020-08-19 00:19:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-08-19 00:19:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2020-08-19 00:19:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-08-19 00:19:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 147 transitions. [2020-08-19 00:19:31,998 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 147 transitions. Word has length 150 [2020-08-19 00:19:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:19:31,999 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 147 transitions. [2020-08-19 00:19:31,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-19 00:19:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 147 transitions. [2020-08-19 00:19:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 00:19:32,002 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:19:32,002 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:19:32,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-19 00:19:32,003 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:19:32,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:19:32,003 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 4 times [2020-08-19 00:19:32,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:19:32,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1524124376] [2020-08-19 00:19:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:19:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 00:19:32,033 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 00:19:32,035 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 00:19:32,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-19 00:19:32,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 12:19:32 BoogieIcfgContainer [2020-08-19 00:19:32,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 00:19:32,084 INFO L168 Benchmark]: Toolchain (without parser) took 8283.55 ms. Allocated memory was 140.5 MB in the beginning and 350.2 MB in the end (delta: 209.7 MB). Free memory was 103.0 MB in the beginning and 183.0 MB in the end (delta: -80.0 MB). Peak memory consumption was 129.7 MB. Max. memory is 7.1 GB. [2020-08-19 00:19:32,085 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-19 00:19:32,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.23 ms. Allocated memory is still 140.5 MB. Free memory was 102.8 MB in the beginning and 93.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-08-19 00:19:32,094 INFO L168 Benchmark]: Boogie Preprocessor took 100.37 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 93.4 MB in the beginning and 181.1 MB in the end (delta: -87.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-08-19 00:19:32,095 INFO L168 Benchmark]: RCFGBuilder took 255.72 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 168.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2020-08-19 00:19:32,096 INFO L168 Benchmark]: TraceAbstraction took 7676.02 ms. Allocated memory was 202.4 MB in the beginning and 350.2 MB in the end (delta: 147.8 MB). Free memory was 167.7 MB in the beginning and 183.0 MB in the end (delta: -15.3 MB). Peak memory consumption was 132.5 MB. Max. memory is 7.1 GB. [2020-08-19 00:19:32,103 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.21 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 246.23 ms. Allocated memory is still 140.5 MB. Free memory was 102.8 MB in the beginning and 93.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.37 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 93.4 MB in the beginning and 181.1 MB in the end (delta: -87.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 255.72 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 168.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7676.02 ms. Allocated memory was 202.4 MB in the beginning and 350.2 MB in the end (delta: 147.8 MB). Free memory was 167.7 MB in the beginning and 183.0 MB in the end (delta: -15.3 MB). Peak memory consumption was 132.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; [L37] CALL, EXPR fibo1(x) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo2(n-1) [L18] COND FALSE !(n < 1) [L20] COND FALSE !(n == 1) [L23] CALL, EXPR fibo1(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo2(n-1) [L18] COND FALSE !(n < 1) [L20] COND FALSE !(n == 1) [L23] CALL, EXPR fibo1(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo2(n-1) [L18] COND FALSE !(n < 1) [L20] COND TRUE n == 1 [L21] return 1; [L13] RET, EXPR fibo2(n-1) [L13] CALL, EXPR fibo2(n-2) [L18] COND TRUE n < 1 [L19] return 0; [L13] RET, EXPR fibo2(n-2) [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) [L23] CALL, EXPR fibo1(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L23] RET, EXPR fibo1(n-2) [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) [L13] CALL, EXPR fibo2(n-2) [L18] COND FALSE !(n < 1) [L20] COND FALSE !(n == 1) [L23] CALL, EXPR fibo1(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L23] RET, EXPR fibo1(n-1) [L23] CALL, EXPR fibo1(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L23] RET, EXPR fibo1(n-2) [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) [L23] CALL, EXPR fibo1(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo2(n-1) [L18] COND FALSE !(n < 1) [L20] COND FALSE !(n == 1) [L23] CALL, EXPR fibo1(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L23] RET, EXPR fibo1(n-1) [L23] CALL, EXPR fibo1(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L23] RET, EXPR fibo1(n-2) [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) [L13] CALL, EXPR fibo2(n-2) [L18] COND FALSE !(n < 1) [L20] COND TRUE n == 1 [L21] return 1; [L13] RET, EXPR fibo2(n-2) [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) [L13] CALL, EXPR fibo2(n-2) [L18] COND FALSE !(n < 1) [L20] COND FALSE !(n == 1) [L23] CALL, EXPR fibo1(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo2(n-1) [L18] COND FALSE !(n < 1) [L20] COND FALSE !(n == 1) [L23] CALL, EXPR fibo1(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L23] RET, EXPR fibo1(n-1) [L23] CALL, EXPR fibo1(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L23] RET, EXPR fibo1(n-2) [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) [L13] CALL, EXPR fibo2(n-2) [L18] COND FALSE !(n < 1) [L20] COND TRUE n == 1 [L21] return 1; [L13] RET, EXPR fibo2(n-2) [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) [L23] CALL, EXPR fibo1(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo2(n-1) [L18] COND FALSE !(n < 1) [L20] COND TRUE n == 1 [L21] return 1; [L13] RET, EXPR fibo2(n-1) [L13] CALL, EXPR fibo2(n-2) [L18] COND TRUE n < 1 [L19] return 0; [L13] RET, EXPR fibo2(n-2) [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 8 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.5s, OverallIterations: 16, TraceHistogramMax: 17, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 460 SDtfs, 472 SDslu, 2192 SDs, 0 SdLazy, 2638 SolverSat, 333 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=15, 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, 15 MinimizatonAttempts, 77 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1333 NumberOfCodeBlocks, 1333 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1141 ConstructedInterpolants, 0 QuantifiedInterpolants, 236129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 2308/3324 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...