/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/id_o20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 00:19:58,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 00:19:58,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 00:19:58,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 00:19:58,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 00:19:58,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 00:19:58,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 00:19:58,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 00:19:58,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 00:19:58,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 00:19:58,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 00:19:58,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 00:19:58,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 00:19:58,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 00:19:58,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 00:19:58,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 00:19:58,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 00:19:58,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 00:19:58,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 00:19:58,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 00:19:58,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 00:19:58,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 00:19:58,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 00:19:58,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 00:19:58,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 00:19:58,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 00:19:58,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 00:19:58,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 00:19:58,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 00:19:58,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 00:19:58,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 00:19:58,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 00:19:58,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 00:19:58,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 00:19:58,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 00:19:58,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 00:19:58,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 00:19:58,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 00:19:58,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 00:19:58,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 00:19:58,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 00:19:58,531 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:58,574 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 00:19:58,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 00:19:58,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 00:19:58,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 00:19:58,577 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 00:19:58,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 00:19:58,577 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 00:19:58,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 00:19:58,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 00:19:58,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 00:19:58,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 00:19:58,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 00:19:58,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 00:19:58,580 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 00:19:58,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 00:19:58,580 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 00:19:58,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 00:19:58,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 00:19:58,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 00:19:58,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 00:19:58,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 00:19:58,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 00:19:58,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 00:19:58,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 00:19:58,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 00:19:58,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 00:19:58,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 00:19:58,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 00:19:58,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 00:19:58,583 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:58,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 00:19:58,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 00:19:58,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 00:19:58,937 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 00:19:58,937 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 00:19:58,938 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o20.c [2020-08-19 00:19:59,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d435abd3a/52389e623dec41f996648cad4e592f8f/FLAG0dc810e9e [2020-08-19 00:19:59,405 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 00:19:59,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_o20.c [2020-08-19 00:19:59,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d435abd3a/52389e623dec41f996648cad4e592f8f/FLAG0dc810e9e [2020-08-19 00:19:59,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d435abd3a/52389e623dec41f996648cad4e592f8f [2020-08-19 00:19:59,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 00:19:59,801 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 00:19:59,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 00:19:59,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 00:19:59,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 00:19:59,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 12:19:59" (1/1) ... [2020-08-19 00:19:59,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e6ef35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:19:59, skipping insertion in model container [2020-08-19 00:19:59,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 12:19:59" (1/1) ... [2020-08-19 00:19:59,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 00:19:59,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 00:20:00,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 00:20:00,041 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 00:20:00,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 00:20:00,078 INFO L208 MainTranslator]: Completed translation [2020-08-19 00:20:00,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:00 WrapperNode [2020-08-19 00:20:00,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 00:20:00,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 00:20:00,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 00:20:00,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 00:20:00,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:00" (1/1) ... [2020-08-19 00:20:00,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:00" (1/1) ... [2020-08-19 00:20:00,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:00" (1/1) ... [2020-08-19 00:20:00,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:00" (1/1) ... [2020-08-19 00:20:00,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:00" (1/1) ... [2020-08-19 00:20:00,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:00" (1/1) ... [2020-08-19 00:20:00,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:00" (1/1) ... [2020-08-19 00:20:00,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 00:20:00,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 00:20:00,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 00:20:00,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 00:20:00,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:00" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 00:20:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 00:20:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 00:20:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-08-19 00:20:00,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 00:20:00,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-08-19 00:20:00,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 00:20:00,284 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-08-19 00:20:00,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 00:20:00,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 00:20:00,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 00:20:00,450 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 00:20:00,451 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 00:20:00,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 12:20:00 BoogieIcfgContainer [2020-08-19 00:20:00,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 00:20:00,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 00:20:00,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 00:20:00,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 00:20:00,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 12:19:59" (1/3) ... [2020-08-19 00:20:00,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac103e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 12:20:00, skipping insertion in model container [2020-08-19 00:20:00,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:20:00" (2/3) ... [2020-08-19 00:20:00,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac103e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 12:20:00, skipping insertion in model container [2020-08-19 00:20:00,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 12:20:00" (3/3) ... [2020-08-19 00:20:00,465 INFO L109 eAbstractionObserver]: Analyzing ICFG id_o20.c [2020-08-19 00:20:00,477 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 00:20:00,485 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 00:20:00,501 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 00:20:00,530 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 00:20:00,530 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 00:20:00,530 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 00:20:00,530 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 00:20:00,531 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 00:20:00,531 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 00:20:00,531 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 00:20:00,531 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 00:20:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-08-19 00:20:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 00:20:00,558 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:00,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:00,560 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-08-19 00:20:00,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:00,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [19475263] [2020-08-19 00:20:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:00,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:00,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:20:00,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [19475263] [2020-08-19 00:20:00,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:20:00,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 00:20:00,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780120552] [2020-08-19 00:20:00,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 00:20:00,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:00,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 00:20:00,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 00:20:00,949 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-08-19 00:20:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:01,031 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-08-19 00:20:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 00:20:01,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 00:20:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:01,048 INFO L225 Difference]: With dead ends: 32 [2020-08-19 00:20:01,049 INFO L226 Difference]: Without dead ends: 18 [2020-08-19 00:20:01,052 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 00:20:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-08-19 00:20:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-08-19 00:20:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-08-19 00:20:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-08-19 00:20:01,107 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-08-19 00:20:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:01,108 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-08-19 00:20:01,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 00:20:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-08-19 00:20:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-19 00:20:01,110 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:01,110 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:01,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 00:20:01,111 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-08-19 00:20:01,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:01,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542522793] [2020-08-19 00:20:01,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-19 00:20:01,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542522793] [2020-08-19 00:20:01,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:01,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 00:20:01,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405741093] [2020-08-19 00:20:01,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 00:20:01,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 00:20:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:20:01,347 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2020-08-19 00:20:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:01,380 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-08-19 00:20:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 00:20:01,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-08-19 00:20:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:01,383 INFO L225 Difference]: With dead ends: 25 [2020-08-19 00:20:01,383 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 00:20:01,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:20:01,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 00:20:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 00:20:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 00:20:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-08-19 00:20:01,392 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-08-19 00:20:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:01,393 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-08-19 00:20:01,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 00:20:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-08-19 00:20:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-19 00:20:01,394 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:01,395 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:01,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 00:20:01,395 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:01,396 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-08-19 00:20:01,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:01,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1010269985] [2020-08-19 00:20:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-08-19 00:20:01,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1010269985] [2020-08-19 00:20:01,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:01,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 00:20:01,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851653826] [2020-08-19 00:20:01,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 00:20:01,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 00:20:01,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-08-19 00:20:01,717 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2020-08-19 00:20:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:01,770 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-08-19 00:20:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 00:20:01,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-08-19 00:20:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:01,773 INFO L225 Difference]: With dead ends: 28 [2020-08-19 00:20:01,773 INFO L226 Difference]: Without dead ends: 24 [2020-08-19 00:20:01,774 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-08-19 00:20:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-08-19 00:20:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-08-19 00:20:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-08-19 00:20:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-08-19 00:20:01,782 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-08-19 00:20:01,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:01,782 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-08-19 00:20:01,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 00:20:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-08-19 00:20:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-19 00:20:01,784 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:01,784 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:01,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 00:20:01,785 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:01,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:01,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-08-19 00:20:01,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:01,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1142171616] [2020-08-19 00:20:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:01,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-19 00:20:02,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1142171616] [2020-08-19 00:20:02,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:02,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 00:20:02,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013707191] [2020-08-19 00:20:02,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 00:20:02,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:02,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 00:20:02,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-08-19 00:20:02,147 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 11 states. [2020-08-19 00:20:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:02,205 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-08-19 00:20:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 00:20:02,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2020-08-19 00:20:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:02,208 INFO L225 Difference]: With dead ends: 31 [2020-08-19 00:20:02,208 INFO L226 Difference]: Without dead ends: 27 [2020-08-19 00:20:02,209 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-08-19 00:20:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-08-19 00:20:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-08-19 00:20:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-08-19 00:20:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-08-19 00:20:02,216 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-08-19 00:20:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:02,216 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-08-19 00:20:02,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 00:20:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-08-19 00:20:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-19 00:20:02,218 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:02,218 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:02,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 00:20:02,219 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:02,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-08-19 00:20:02,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:02,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [701069553] [2020-08-19 00:20:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-19 00:20:02,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [701069553] [2020-08-19 00:20:02,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:02,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-19 00:20:02,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031236474] [2020-08-19 00:20:02,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-19 00:20:02,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:02,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-19 00:20:02,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-08-19 00:20:02,506 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2020-08-19 00:20:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:02,581 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-08-19 00:20:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-19 00:20:02,582 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-08-19 00:20:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:02,583 INFO L225 Difference]: With dead ends: 34 [2020-08-19 00:20:02,584 INFO L226 Difference]: Without dead ends: 30 [2020-08-19 00:20:02,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-08-19 00:20:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-19 00:20:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-19 00:20:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-19 00:20:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-08-19 00:20:02,591 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-08-19 00:20:02,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:02,592 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-08-19 00:20:02,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-19 00:20:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-08-19 00:20:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-19 00:20:02,594 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:02,594 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:02,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 00:20:02,595 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:02,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:02,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-08-19 00:20:02,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:02,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1242776417] [2020-08-19 00:20:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:02,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-19 00:20:03,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1242776417] [2020-08-19 00:20:03,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:03,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-19 00:20:03,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887051953] [2020-08-19 00:20:03,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-19 00:20:03,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:03,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-19 00:20:03,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-08-19 00:20:03,018 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2020-08-19 00:20:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:03,109 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-08-19 00:20:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-19 00:20:03,109 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-08-19 00:20:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:03,111 INFO L225 Difference]: With dead ends: 37 [2020-08-19 00:20:03,111 INFO L226 Difference]: Without dead ends: 33 [2020-08-19 00:20:03,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-08-19 00:20:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-19 00:20:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-19 00:20:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-19 00:20:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-08-19 00:20:03,118 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-08-19 00:20:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:03,119 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-08-19 00:20:03,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-19 00:20:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-08-19 00:20:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-19 00:20:03,121 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:03,121 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:03,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 00:20:03,121 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:03,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-08-19 00:20:03,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:03,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748473300] [2020-08-19 00:20:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-19 00:20:03,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748473300] [2020-08-19 00:20:03,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:03,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-19 00:20:03,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057938651] [2020-08-19 00:20:03,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-19 00:20:03,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:03,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-19 00:20:03,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-08-19 00:20:03,483 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2020-08-19 00:20:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:03,613 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-08-19 00:20:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-19 00:20:03,613 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2020-08-19 00:20:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:03,615 INFO L225 Difference]: With dead ends: 40 [2020-08-19 00:20:03,615 INFO L226 Difference]: Without dead ends: 36 [2020-08-19 00:20:03,616 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-08-19 00:20:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-08-19 00:20:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-08-19 00:20:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-08-19 00:20:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-08-19 00:20:03,622 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-08-19 00:20:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:03,623 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-08-19 00:20:03,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-19 00:20:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-08-19 00:20:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-19 00:20:03,625 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:03,625 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:03,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 00:20:03,625 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:03,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:03,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2020-08-19 00:20:03,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:03,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592235814] [2020-08-19 00:20:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:03,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-19 00:20:04,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592235814] [2020-08-19 00:20:04,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:04,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-19 00:20:04,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102645346] [2020-08-19 00:20:04,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-19 00:20:04,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-19 00:20:04,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-08-19 00:20:04,117 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2020-08-19 00:20:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:04,293 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-08-19 00:20:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-19 00:20:04,294 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2020-08-19 00:20:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:04,296 INFO L225 Difference]: With dead ends: 43 [2020-08-19 00:20:04,296 INFO L226 Difference]: Without dead ends: 39 [2020-08-19 00:20:04,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-08-19 00:20:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-19 00:20:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-19 00:20:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 00:20:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-08-19 00:20:04,310 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-08-19 00:20:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:04,311 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-08-19 00:20:04,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-19 00:20:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-08-19 00:20:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-19 00:20:04,315 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:04,315 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:04,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 00:20:04,316 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:04,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:04,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2020-08-19 00:20:04,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:04,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903597606] [2020-08-19 00:20:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-08-19 00:20:04,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903597606] [2020-08-19 00:20:04,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:04,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-08-19 00:20:04,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691677354] [2020-08-19 00:20:04,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-19 00:20:04,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:04,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-19 00:20:04,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-08-19 00:20:04,974 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 21 states. [2020-08-19 00:20:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:05,149 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-08-19 00:20:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 00:20:05,150 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2020-08-19 00:20:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:05,151 INFO L225 Difference]: With dead ends: 46 [2020-08-19 00:20:05,151 INFO L226 Difference]: Without dead ends: 42 [2020-08-19 00:20:05,154 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-08-19 00:20:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-19 00:20:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-19 00:20:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-19 00:20:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-08-19 00:20:05,166 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-08-19 00:20:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:05,166 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-08-19 00:20:05,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-19 00:20:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-08-19 00:20:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-19 00:20:05,169 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:05,169 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:05,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 00:20:05,171 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2020-08-19 00:20:05,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:05,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [482515446] [2020-08-19 00:20:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-08-19 00:20:05,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [482515446] [2020-08-19 00:20:05,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:05,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-08-19 00:20:05,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097243299] [2020-08-19 00:20:05,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-08-19 00:20:05,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:05,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-08-19 00:20:05,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-08-19 00:20:05,805 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 23 states. [2020-08-19 00:20:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:06,019 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-08-19 00:20:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-19 00:20:06,020 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2020-08-19 00:20:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:06,021 INFO L225 Difference]: With dead ends: 49 [2020-08-19 00:20:06,021 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 00:20:06,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-08-19 00:20:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 00:20:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-19 00:20:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-19 00:20:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-08-19 00:20:06,034 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-08-19 00:20:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:06,034 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-08-19 00:20:06,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-08-19 00:20:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-08-19 00:20:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-19 00:20:06,040 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:06,040 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:06,040 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 00:20:06,041 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:06,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:06,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2020-08-19 00:20:06,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:06,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [38148217] [2020-08-19 00:20:06,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-08-19 00:20:06,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [38148217] [2020-08-19 00:20:06,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:06,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-08-19 00:20:06,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326639801] [2020-08-19 00:20:06,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-08-19 00:20:06,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:06,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-08-19 00:20:06,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-08-19 00:20:06,825 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 25 states. [2020-08-19 00:20:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:07,074 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-08-19 00:20:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-08-19 00:20:07,075 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2020-08-19 00:20:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:07,076 INFO L225 Difference]: With dead ends: 52 [2020-08-19 00:20:07,077 INFO L226 Difference]: Without dead ends: 48 [2020-08-19 00:20:07,078 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-08-19 00:20:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-19 00:20:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-08-19 00:20:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-19 00:20:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-08-19 00:20:07,092 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-08-19 00:20:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:07,093 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-08-19 00:20:07,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-08-19 00:20:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-08-19 00:20:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-19 00:20:07,096 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:07,096 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:07,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 00:20:07,097 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:07,097 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2020-08-19 00:20:07,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:07,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [445268139] [2020-08-19 00:20:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-08-19 00:20:07,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [445268139] [2020-08-19 00:20:07,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:07,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-08-19 00:20:07,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134392735] [2020-08-19 00:20:07,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-08-19 00:20:07,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:07,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-08-19 00:20:07,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2020-08-19 00:20:07,949 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 27 states. [2020-08-19 00:20:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:08,222 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-08-19 00:20:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-19 00:20:08,223 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2020-08-19 00:20:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:08,227 INFO L225 Difference]: With dead ends: 55 [2020-08-19 00:20:08,227 INFO L226 Difference]: Without dead ends: 51 [2020-08-19 00:20:08,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2020-08-19 00:20:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-08-19 00:20:08,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-08-19 00:20:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-08-19 00:20:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-08-19 00:20:08,237 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-08-19 00:20:08,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:08,238 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-08-19 00:20:08,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-08-19 00:20:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-08-19 00:20:08,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-19 00:20:08,239 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:08,240 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:08,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 00:20:08,240 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:08,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2020-08-19 00:20:08,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:08,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [41708218] [2020-08-19 00:20:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:08,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-08-19 00:20:09,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [41708218] [2020-08-19 00:20:09,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:09,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-08-19 00:20:09,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726921876] [2020-08-19 00:20:09,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-08-19 00:20:09,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-08-19 00:20:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-08-19 00:20:09,319 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 29 states. [2020-08-19 00:20:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:09,633 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-08-19 00:20:09,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-08-19 00:20:09,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2020-08-19 00:20:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:09,635 INFO L225 Difference]: With dead ends: 58 [2020-08-19 00:20:09,635 INFO L226 Difference]: Without dead ends: 54 [2020-08-19 00:20:09,638 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-08-19 00:20:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-08-19 00:20:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-08-19 00:20:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-19 00:20:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-08-19 00:20:09,649 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-08-19 00:20:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:09,651 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-08-19 00:20:09,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-08-19 00:20:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-08-19 00:20:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-19 00:20:09,653 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:09,653 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:09,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 00:20:09,653 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2020-08-19 00:20:09,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:09,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1453797408] [2020-08-19 00:20:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:09,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-08-19 00:20:10,647 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1453797408] [2020-08-19 00:20:10,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:10,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-08-19 00:20:10,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671567088] [2020-08-19 00:20:10,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-08-19 00:20:10,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:10,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-08-19 00:20:10,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2020-08-19 00:20:10,650 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 31 states. [2020-08-19 00:20:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:11,046 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-08-19 00:20:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-08-19 00:20:11,047 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 91 [2020-08-19 00:20:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:11,048 INFO L225 Difference]: With dead ends: 61 [2020-08-19 00:20:11,048 INFO L226 Difference]: Without dead ends: 57 [2020-08-19 00:20:11,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2020-08-19 00:20:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-19 00:20:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-08-19 00:20:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-19 00:20:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-08-19 00:20:11,059 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-08-19 00:20:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:11,065 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-08-19 00:20:11,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-08-19 00:20:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-08-19 00:20:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-19 00:20:11,066 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:11,066 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:11,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-19 00:20:11,068 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2020-08-19 00:20:11,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:11,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039375467] [2020-08-19 00:20:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:11,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-08-19 00:20:12,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039375467] [2020-08-19 00:20:12,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:12,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2020-08-19 00:20:12,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441709720] [2020-08-19 00:20:12,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-08-19 00:20:12,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:12,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-08-19 00:20:12,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2020-08-19 00:20:12,201 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 33 states. [2020-08-19 00:20:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:12,658 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-08-19 00:20:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-08-19 00:20:12,659 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 97 [2020-08-19 00:20:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:12,660 INFO L225 Difference]: With dead ends: 64 [2020-08-19 00:20:12,660 INFO L226 Difference]: Without dead ends: 60 [2020-08-19 00:20:12,661 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2020-08-19 00:20:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-08-19 00:20:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-08-19 00:20:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-08-19 00:20:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-08-19 00:20:12,669 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-08-19 00:20:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:12,670 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-08-19 00:20:12,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-08-19 00:20:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-08-19 00:20:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-08-19 00:20:12,672 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:12,673 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:12,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-19 00:20:12,673 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2020-08-19 00:20:12,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:12,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1198645163] [2020-08-19 00:20:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:12,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:13,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-08-19 00:20:14,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1198645163] [2020-08-19 00:20:14,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:14,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2020-08-19 00:20:14,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102964415] [2020-08-19 00:20:14,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-08-19 00:20:14,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:14,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-08-19 00:20:14,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-08-19 00:20:14,078 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 35 states. [2020-08-19 00:20:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:14,618 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-08-19 00:20:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-19 00:20:14,619 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 103 [2020-08-19 00:20:14,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:14,620 INFO L225 Difference]: With dead ends: 67 [2020-08-19 00:20:14,620 INFO L226 Difference]: Without dead ends: 63 [2020-08-19 00:20:14,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-08-19 00:20:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-08-19 00:20:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-08-19 00:20:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-08-19 00:20:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-08-19 00:20:14,626 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-08-19 00:20:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:14,627 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-08-19 00:20:14,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-08-19 00:20:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-08-19 00:20:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 00:20:14,628 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:14,629 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:14,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-19 00:20:14,629 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2020-08-19 00:20:14,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:14,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [218413191] [2020-08-19 00:20:14,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:14,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-08-19 00:20:15,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [218413191] [2020-08-19 00:20:15,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:15,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2020-08-19 00:20:15,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132530264] [2020-08-19 00:20:15,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-08-19 00:20:15,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:15,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-08-19 00:20:15,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2020-08-19 00:20:15,953 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 37 states. [2020-08-19 00:20:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:16,486 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-08-19 00:20:16,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-08-19 00:20:16,487 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2020-08-19 00:20:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:16,488 INFO L225 Difference]: With dead ends: 70 [2020-08-19 00:20:16,488 INFO L226 Difference]: Without dead ends: 66 [2020-08-19 00:20:16,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2020-08-19 00:20:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-08-19 00:20:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-08-19 00:20:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-19 00:20:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-08-19 00:20:16,499 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2020-08-19 00:20:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:16,500 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-08-19 00:20:16,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-08-19 00:20:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-08-19 00:20:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-08-19 00:20:16,501 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:16,501 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:16,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-19 00:20:16,502 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:16,502 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2020-08-19 00:20:16,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:16,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [708648162] [2020-08-19 00:20:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:16,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:17,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-08-19 00:20:18,052 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [708648162] [2020-08-19 00:20:18,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:18,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2020-08-19 00:20:18,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527597725] [2020-08-19 00:20:18,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-08-19 00:20:18,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:18,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-08-19 00:20:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2020-08-19 00:20:18,054 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 39 states. [2020-08-19 00:20:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:18,714 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-08-19 00:20:18,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-08-19 00:20:18,714 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 115 [2020-08-19 00:20:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:18,716 INFO L225 Difference]: With dead ends: 73 [2020-08-19 00:20:18,716 INFO L226 Difference]: Without dead ends: 69 [2020-08-19 00:20:18,718 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2020-08-19 00:20:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-08-19 00:20:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-08-19 00:20:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-08-19 00:20:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-08-19 00:20:18,723 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2020-08-19 00:20:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:18,723 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-08-19 00:20:18,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-08-19 00:20:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-08-19 00:20:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-19 00:20:18,725 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:18,725 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:18,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-19 00:20:18,725 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:18,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:18,726 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2020-08-19 00:20:18,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:18,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1077281125] [2020-08-19 00:20:18,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:18,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:19,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-08-19 00:20:20,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1077281125] [2020-08-19 00:20:20,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:20,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2020-08-19 00:20:20,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135589753] [2020-08-19 00:20:20,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-08-19 00:20:20,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:20,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-08-19 00:20:20,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2020-08-19 00:20:20,518 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 41 states. [2020-08-19 00:20:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:21,244 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-08-19 00:20:21,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-19 00:20:21,245 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 121 [2020-08-19 00:20:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:21,246 INFO L225 Difference]: With dead ends: 76 [2020-08-19 00:20:21,246 INFO L226 Difference]: Without dead ends: 72 [2020-08-19 00:20:21,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2020-08-19 00:20:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-08-19 00:20:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-08-19 00:20:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-19 00:20:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-08-19 00:20:21,253 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2020-08-19 00:20:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:21,254 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-08-19 00:20:21,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-08-19 00:20:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-08-19 00:20:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-08-19 00:20:21,255 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:21,255 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:21,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-08-19 00:20:21,256 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2020-08-19 00:20:21,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:21,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1665951196] [2020-08-19 00:20:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:21,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:20:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:21,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 00:20:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:21,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:21,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:21,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:21,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:21,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:21,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:21,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:21,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:22,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:22,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:22,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:22,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:22,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:22,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:22,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:22,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:22,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:22,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:23,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 00:20:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:20:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-08-19 00:20:23,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1665951196] [2020-08-19 00:20:23,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 00:20:23,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2020-08-19 00:20:23,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368825188] [2020-08-19 00:20:23,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-08-19 00:20:23,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:20:23,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-08-19 00:20:23,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2020-08-19 00:20:23,194 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 43 states. [2020-08-19 00:20:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:20:24,006 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-08-19 00:20:24,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-08-19 00:20:24,007 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 127 [2020-08-19 00:20:24,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:20:24,008 INFO L225 Difference]: With dead ends: 79 [2020-08-19 00:20:24,009 INFO L226 Difference]: Without dead ends: 75 [2020-08-19 00:20:24,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2020-08-19 00:20:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-08-19 00:20:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-08-19 00:20:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-08-19 00:20:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-08-19 00:20:24,015 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2020-08-19 00:20:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:20:24,016 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-08-19 00:20:24,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-08-19 00:20:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-08-19 00:20:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-08-19 00:20:24,017 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:20:24,018 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:20:24,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-08-19 00:20:24,018 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:20:24,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:20:24,018 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2020-08-19 00:20:24,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:20:24,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155189304] [2020-08-19 00:20:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:20:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 00:20:24,104 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 00:20:24,104 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 00:20:24,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-08-19 00:20:24,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 12:20:24 BoogieIcfgContainer [2020-08-19 00:20:24,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 00:20:24,137 INFO L168 Benchmark]: Toolchain (without parser) took 24335.45 ms. Allocated memory was 141.6 MB in the beginning and 486.5 MB in the end (delta: 345.0 MB). Free memory was 105.0 MB in the beginning and 305.9 MB in the end (delta: -200.9 MB). Peak memory consumption was 144.1 MB. Max. memory is 7.1 GB. [2020-08-19 00:20:24,138 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-19 00:20:24,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.87 ms. Allocated memory is still 141.6 MB. Free memory was 104.7 MB in the beginning and 95.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-19 00:20:24,139 INFO L168 Benchmark]: Boogie Preprocessor took 35.45 ms. Allocated memory is still 141.6 MB. Free memory was 95.5 MB in the beginning and 94.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-19 00:20:24,140 INFO L168 Benchmark]: RCFGBuilder took 337.96 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 173.8 MB in the end (delta: -79.7 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-08-19 00:20:24,141 INFO L168 Benchmark]: TraceAbstraction took 23678.51 ms. Allocated memory was 205.0 MB in the beginning and 486.5 MB in the end (delta: 281.5 MB). Free memory was 173.1 MB in the beginning and 305.9 MB in the end (delta: -132.7 MB). Peak memory consumption was 148.8 MB. Max. memory is 7.1 GB. [2020-08-19 00:20:24,143 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.16 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.87 ms. Allocated memory is still 141.6 MB. Free memory was 104.7 MB in the beginning and 95.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.45 ms. Allocated memory is still 141.6 MB. Free memory was 95.5 MB in the beginning and 94.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 337.96 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 173.8 MB in the end (delta: -79.7 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23678.51 ms. Allocated memory was 205.0 MB in the beginning and 486.5 MB in the end (delta: 281.5 MB). Free memory was 173.1 MB in the beginning and 305.9 MB in the end (delta: -132.7 MB). Peak memory consumption was 148.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND TRUE x==0 [L5] return 0; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.5s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 684 SDtfs, 2 SDslu, 14532 SDs, 0 SdLazy, 8656 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 1533 NumberOfCodeBlocks, 1533 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 465600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/7600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...