/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 false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:17:15,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:17:15,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:17:15,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:17:15,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:17:15,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:17:15,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:17:15,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:17:15,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:17:15,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:17:15,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:17:15,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:17:15,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:17:15,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:17:15,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:17:15,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:17:15,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:17:15,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:17:15,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:17:15,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:17:15,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:17:15,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:17:15,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:17:15,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:17:15,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:17:15,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:17:15,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:17:15,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:17:15,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:17:15,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:17:15,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:17:15,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:17:15,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:17:15,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:17:15,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:17:15,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:17:15,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:17:15,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:17:15,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:17:15,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:17:15,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:17:15,946 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-09-21 10:17:16,006 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:17:16,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:17:16,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:17:16,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:17:16,009 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:17:16,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:17:16,009 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:17:16,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:17:16,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:17:16,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:17:16,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:17:16,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:17:16,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:17:16,012 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:17:16,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:17:16,012 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:17:16,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:17:16,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:17:16,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:17:16,013 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:17:16,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:17:16,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:17:16,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:17:16,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:17:16,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:17:16,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:17:16,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:17:16,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:17:16,015 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:17:16,015 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 -> false [2020-09-21 10:17:16,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:17:16,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:17:16,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:17:16,509 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:17:16,510 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:17:16,511 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2020-09-21 10:17:16,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ae16e45ad/4bd8dc750256476c814c3c4f2e6b92b9/FLAGa33ec3536 [2020-09-21 10:17:17,134 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:17:17,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2020-09-21 10:17:17,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ae16e45ad/4bd8dc750256476c814c3c4f2e6b92b9/FLAGa33ec3536 [2020-09-21 10:17:17,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ae16e45ad/4bd8dc750256476c814c3c4f2e6b92b9 [2020-09-21 10:17:17,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:17:17,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:17:17,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:17:17,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:17:17,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:17:17,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:17:17" (1/1) ... [2020-09-21 10:17:17,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78523b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17, skipping insertion in model container [2020-09-21 10:17:17,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:17:17" (1/1) ... [2020-09-21 10:17:17,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:17:17,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:17:17,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:17:17,830 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:17:17,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:17:17,892 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:17:17,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17 WrapperNode [2020-09-21 10:17:17,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:17:17,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:17:17,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:17:17,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:17:17,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17" (1/1) ... [2020-09-21 10:17:17,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17" (1/1) ... [2020-09-21 10:17:18,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17" (1/1) ... [2020-09-21 10:17:18,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17" (1/1) ... [2020-09-21 10:17:18,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17" (1/1) ... [2020-09-21 10:17:18,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17" (1/1) ... [2020-09-21 10:17:18,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17" (1/1) ... [2020-09-21 10:17:18,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:17:18,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:17:18,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:17:18,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:17:18,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17" (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-09-21 10:17:18,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:17:18,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:17:18,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-21 10:17:18,108 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2020-09-21 10:17:18,109 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2020-09-21 10:17:18,109 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2020-09-21 10:17:18,109 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:17:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:17:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-21 10:17:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-21 10:17:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-21 10:17:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2020-09-21 10:17:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2020-09-21 10:17:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2020-09-21 10:17:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:17:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:17:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:17:18,552 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:17:18,553 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-21 10:17:18,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:17:18 BoogieIcfgContainer [2020-09-21 10:17:18,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:17:18,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:17:18,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:17:18,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:17:18,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:17:17" (1/3) ... [2020-09-21 10:17:18,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ca88de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:17:18, skipping insertion in model container [2020-09-21 10:17:18,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:17" (2/3) ... [2020-09-21 10:17:18,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ca88de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:17:18, skipping insertion in model container [2020-09-21 10:17:18,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:17:18" (3/3) ... [2020-09-21 10:17:18,568 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2020-09-21 10:17:18,582 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:17:18,591 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:17:18,611 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:17:18,641 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:17:18,641 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:17:18,641 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:17:18,641 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:17:18,642 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:17:18,642 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:17:18,642 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:17:18,642 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:17:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-09-21 10:17:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-21 10:17:18,672 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:18,673 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:18,673 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:18,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:18,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1570912407, now seen corresponding path program 1 times [2020-09-21 10:17:18,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:18,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763631144] [2020-09-21 10:17:18,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:18,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:18,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:18,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-21 10:17:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-21 10:17:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-21 10:17:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:19,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763631144] [2020-09-21 10:17:19,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:19,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-09-21 10:17:19,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218761182] [2020-09-21 10:17:19,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:17:19,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:17:19,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:17:19,093 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 4 states. [2020-09-21 10:17:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:19,309 INFO L93 Difference]: Finished difference Result 136 states and 213 transitions. [2020-09-21 10:17:19,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:17:19,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-09-21 10:17:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:19,343 INFO L225 Difference]: With dead ends: 136 [2020-09-21 10:17:19,344 INFO L226 Difference]: Without dead ends: 76 [2020-09-21 10:17:19,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:17:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-09-21 10:17:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2020-09-21 10:17:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-09-21 10:17:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2020-09-21 10:17:19,445 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 48 [2020-09-21 10:17:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:19,446 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2020-09-21 10:17:19,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:17:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2020-09-21 10:17:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-21 10:17:19,450 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:19,450 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:19,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:17:19,451 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:19,452 INFO L82 PathProgramCache]: Analyzing trace with hash -771486554, now seen corresponding path program 1 times [2020-09-21 10:17:19,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:19,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1747860964] [2020-09-21 10:17:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-21 10:17:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-21 10:17:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:19,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1747860964] [2020-09-21 10:17:19,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:19,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-09-21 10:17:19,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446391114] [2020-09-21 10:17:19,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:17:19,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:19,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:17:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:17:19,605 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand 4 states. [2020-09-21 10:17:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:19,735 INFO L93 Difference]: Finished difference Result 129 states and 182 transitions. [2020-09-21 10:17:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:17:19,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-09-21 10:17:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:19,741 INFO L225 Difference]: With dead ends: 129 [2020-09-21 10:17:19,741 INFO L226 Difference]: Without dead ends: 79 [2020-09-21 10:17:19,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:17:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-09-21 10:17:19,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2020-09-21 10:17:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-21 10:17:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2020-09-21 10:17:19,783 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 51 [2020-09-21 10:17:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:19,783 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2020-09-21 10:17:19,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:17:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2020-09-21 10:17:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-21 10:17:19,791 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:19,791 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:19,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:17:19,792 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:19,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1553856699, now seen corresponding path program 1 times [2020-09-21 10:17:19,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:19,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [460973352] [2020-09-21 10:17:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-21 10:17:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-21 10:17:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-21 10:17:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:19,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [460973352] [2020-09-21 10:17:19,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:19,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 10:17:19,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309684832] [2020-09-21 10:17:19,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:17:19,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:19,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:17:19,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:17:19,980 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand 5 states. [2020-09-21 10:17:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:20,082 INFO L93 Difference]: Finished difference Result 145 states and 205 transitions. [2020-09-21 10:17:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:17:20,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-09-21 10:17:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:20,085 INFO L225 Difference]: With dead ends: 145 [2020-09-21 10:17:20,085 INFO L226 Difference]: Without dead ends: 89 [2020-09-21 10:17:20,086 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-09-21 10:17:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2020-09-21 10:17:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-09-21 10:17:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2020-09-21 10:17:20,103 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 53 [2020-09-21 10:17:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:20,104 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2020-09-21 10:17:20,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:17:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2020-09-21 10:17:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-21 10:17:20,109 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:20,110 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:20,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:17:20,112 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash 76110071, now seen corresponding path program 1 times [2020-09-21 10:17:20,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:20,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [314228666] [2020-09-21 10:17:20,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-21 10:17:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-21 10:17:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-21 10:17:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:20,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [314228666] [2020-09-21 10:17:20,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:20,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 10:17:20,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477752891] [2020-09-21 10:17:20,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:17:20,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:20,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:17:20,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:17:20,271 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand 5 states. [2020-09-21 10:17:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:20,355 INFO L93 Difference]: Finished difference Result 156 states and 218 transitions. [2020-09-21 10:17:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:17:20,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-09-21 10:17:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:20,358 INFO L225 Difference]: With dead ends: 156 [2020-09-21 10:17:20,358 INFO L226 Difference]: Without dead ends: 93 [2020-09-21 10:17:20,359 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-21 10:17:20,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2020-09-21 10:17:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-21 10:17:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2020-09-21 10:17:20,373 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 54 [2020-09-21 10:17:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:20,374 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2020-09-21 10:17:20,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:17:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2020-09-21 10:17:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-21 10:17:20,376 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:20,376 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:20,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:17:20,377 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:20,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1237680982, now seen corresponding path program 1 times [2020-09-21 10:17:20,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:20,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1842138621] [2020-09-21 10:17:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-21 10:17:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-21 10:17:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-21 10:17:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:20,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1842138621] [2020-09-21 10:17:20,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:20,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:17:20,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208143581] [2020-09-21 10:17:20,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:17:20,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:20,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:17:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:20,513 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand 6 states. [2020-09-21 10:17:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:20,612 INFO L93 Difference]: Finished difference Result 166 states and 233 transitions. [2020-09-21 10:17:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:17:20,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2020-09-21 10:17:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:20,614 INFO L225 Difference]: With dead ends: 166 [2020-09-21 10:17:20,614 INFO L226 Difference]: Without dead ends: 106 [2020-09-21 10:17:20,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:17:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-09-21 10:17:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2020-09-21 10:17:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-09-21 10:17:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 117 transitions. [2020-09-21 10:17:20,630 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 117 transitions. Word has length 56 [2020-09-21 10:17:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:20,631 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 117 transitions. [2020-09-21 10:17:20,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:17:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 117 transitions. [2020-09-21 10:17:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-09-21 10:17:20,633 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:20,633 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:20,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:17:20,634 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash 714432262, now seen corresponding path program 2 times [2020-09-21 10:17:20,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:20,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1506053779] [2020-09-21 10:17:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-21 10:17:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-09-21 10:17:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-09-21 10:17:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:20,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1506053779] [2020-09-21 10:17:20,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:20,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:17:20,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204085775] [2020-09-21 10:17:20,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:17:20,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:20,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:17:20,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:20,750 INFO L87 Difference]: Start difference. First operand 84 states and 117 transitions. Second operand 6 states. [2020-09-21 10:17:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:20,844 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2020-09-21 10:17:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:17:20,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2020-09-21 10:17:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:20,846 INFO L225 Difference]: With dead ends: 176 [2020-09-21 10:17:20,846 INFO L226 Difference]: Without dead ends: 110 [2020-09-21 10:17:20,847 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:17:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-09-21 10:17:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2020-09-21 10:17:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-09-21 10:17:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2020-09-21 10:17:20,863 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 124 transitions. Word has length 57 [2020-09-21 10:17:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:20,864 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 124 transitions. [2020-09-21 10:17:20,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:17:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 124 transitions. [2020-09-21 10:17:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-09-21 10:17:20,865 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:20,865 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:20,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:17:20,866 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:20,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash 484983205, now seen corresponding path program 2 times [2020-09-21 10:17:20,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:20,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1297742353] [2020-09-21 10:17:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-21 10:17:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:20,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-21 10:17:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:21,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1297742353] [2020-09-21 10:17:21,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:21,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:17:21,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029553235] [2020-09-21 10:17:21,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:17:21,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:21,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:17:21,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:17:21,009 INFO L87 Difference]: Start difference. First operand 89 states and 124 transitions. Second operand 7 states. [2020-09-21 10:17:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:21,130 INFO L93 Difference]: Finished difference Result 178 states and 251 transitions. [2020-09-21 10:17:21,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:17:21,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-09-21 10:17:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:21,133 INFO L225 Difference]: With dead ends: 178 [2020-09-21 10:17:21,133 INFO L226 Difference]: Without dead ends: 115 [2020-09-21 10:17:21,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:17:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-09-21 10:17:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2020-09-21 10:17:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-21 10:17:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2020-09-21 10:17:21,160 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 59 [2020-09-21 10:17:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:21,160 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2020-09-21 10:17:21,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:17:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2020-09-21 10:17:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-09-21 10:17:21,166 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:21,167 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:21,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:17:21,168 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:21,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:21,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1144362345, now seen corresponding path program 3 times [2020-09-21 10:17:21,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:21,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1359516951] [2020-09-21 10:17:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-21 10:17:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-09-21 10:17:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-21 10:17:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:21,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1359516951] [2020-09-21 10:17:21,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:21,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:17:21,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123838349] [2020-09-21 10:17:21,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:17:21,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:17:21,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:17:21,299 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand 7 states. [2020-09-21 10:17:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:21,386 INFO L93 Difference]: Finished difference Result 193 states and 268 transitions. [2020-09-21 10:17:21,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:17:21,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2020-09-21 10:17:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:21,388 INFO L225 Difference]: With dead ends: 193 [2020-09-21 10:17:21,389 INFO L226 Difference]: Without dead ends: 124 [2020-09-21 10:17:21,389 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:17:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-09-21 10:17:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2020-09-21 10:17:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-21 10:17:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2020-09-21 10:17:21,405 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 60 [2020-09-21 10:17:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:21,405 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2020-09-21 10:17:21,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:17:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2020-09-21 10:17:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-21 10:17:21,406 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:21,407 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:21,407 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:17:21,407 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash 889761014, now seen corresponding path program 3 times [2020-09-21 10:17:21,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:21,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [794447092] [2020-09-21 10:17:21,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-21 10:17:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-21 10:17:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-21 10:17:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:21,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [794447092] [2020-09-21 10:17:21,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:21,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:17:21,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054003623] [2020-09-21 10:17:21,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:17:21,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:21,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:17:21,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:17:21,604 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand 8 states. [2020-09-21 10:17:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:21,767 INFO L93 Difference]: Finished difference Result 190 states and 269 transitions. [2020-09-21 10:17:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:17:21,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-09-21 10:17:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:21,771 INFO L225 Difference]: With dead ends: 190 [2020-09-21 10:17:21,771 INFO L226 Difference]: Without dead ends: 124 [2020-09-21 10:17:21,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:17:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-09-21 10:17:21,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 96. [2020-09-21 10:17:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-09-21 10:17:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2020-09-21 10:17:21,791 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 62 [2020-09-21 10:17:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:21,792 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2020-09-21 10:17:21,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:17:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2020-09-21 10:17:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-21 10:17:21,793 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:21,793 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:21,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:17:21,794 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:21,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1481152154, now seen corresponding path program 4 times [2020-09-21 10:17:21,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:21,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1668004112] [2020-09-21 10:17:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-21 10:17:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-21 10:17:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-21 10:17:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:21,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1668004112] [2020-09-21 10:17:21,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:21,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:17:21,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419916735] [2020-09-21 10:17:21,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:17:21,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:17:21,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:17:21,956 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand 8 states. [2020-09-21 10:17:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:22,052 INFO L93 Difference]: Finished difference Result 210 states and 291 transitions. [2020-09-21 10:17:22,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:17:22,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-09-21 10:17:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:22,054 INFO L225 Difference]: With dead ends: 210 [2020-09-21 10:17:22,054 INFO L226 Difference]: Without dead ends: 138 [2020-09-21 10:17:22,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:17:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-09-21 10:17:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2020-09-21 10:17:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-21 10:17:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2020-09-21 10:17:22,065 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 63 [2020-09-21 10:17:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:22,065 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2020-09-21 10:17:22,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:17:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2020-09-21 10:17:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-21 10:17:22,067 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:22,067 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:22,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:17:22,067 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash -642698235, now seen corresponding path program 4 times [2020-09-21 10:17:22,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:22,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [71919119] [2020-09-21 10:17:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-21 10:17:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-09-21 10:17:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-21 10:17:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:22,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [71919119] [2020-09-21 10:17:22,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:22,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:17:22,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530161399] [2020-09-21 10:17:22,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:17:22,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:22,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:17:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:17:22,235 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand 9 states. [2020-09-21 10:17:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:22,387 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2020-09-21 10:17:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:17:22,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-09-21 10:17:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:22,389 INFO L225 Difference]: With dead ends: 202 [2020-09-21 10:17:22,390 INFO L226 Difference]: Without dead ends: 133 [2020-09-21 10:17:22,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:17:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-21 10:17:22,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 102. [2020-09-21 10:17:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-09-21 10:17:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2020-09-21 10:17:22,401 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 65 [2020-09-21 10:17:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:22,402 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2020-09-21 10:17:22,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:17:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2020-09-21 10:17:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-21 10:17:22,404 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:22,404 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:22,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:17:22,405 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:22,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:22,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1742748617, now seen corresponding path program 5 times [2020-09-21 10:17:22,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:22,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [391044354] [2020-09-21 10:17:22,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-21 10:17:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-21 10:17:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:22,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [391044354] [2020-09-21 10:17:22,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:22,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:17:22,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969005270] [2020-09-21 10:17:22,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:17:22,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:22,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:17:22,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:17:22,558 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand 9 states. [2020-09-21 10:17:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:22,674 INFO L93 Difference]: Finished difference Result 227 states and 314 transitions. [2020-09-21 10:17:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:17:22,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-09-21 10:17:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:22,678 INFO L225 Difference]: With dead ends: 227 [2020-09-21 10:17:22,678 INFO L226 Difference]: Without dead ends: 152 [2020-09-21 10:17:22,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:17:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-09-21 10:17:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 107. [2020-09-21 10:17:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-09-21 10:17:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 151 transitions. [2020-09-21 10:17:22,688 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 151 transitions. Word has length 66 [2020-09-21 10:17:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:22,689 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 151 transitions. [2020-09-21 10:17:22,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:17:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 151 transitions. [2020-09-21 10:17:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-09-21 10:17:22,690 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:22,690 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:22,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:17:22,691 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:22,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:22,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1366171286, now seen corresponding path program 5 times [2020-09-21 10:17:22,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:22,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [118306849] [2020-09-21 10:17:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-21 10:17:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-21 10:17:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-21 10:17:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:22,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [118306849] [2020-09-21 10:17:22,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:22,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:17:22,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412156502] [2020-09-21 10:17:22,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:17:22,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:22,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:17:22,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:17:22,907 INFO L87 Difference]: Start difference. First operand 107 states and 151 transitions. Second operand 10 states. [2020-09-21 10:17:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:23,139 INFO L93 Difference]: Finished difference Result 214 states and 305 transitions. [2020-09-21 10:17:23,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:17:23,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2020-09-21 10:17:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:23,142 INFO L225 Difference]: With dead ends: 214 [2020-09-21 10:17:23,142 INFO L226 Difference]: Without dead ends: 142 [2020-09-21 10:17:23,143 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:17:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-09-21 10:17:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2020-09-21 10:17:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-09-21 10:17:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2020-09-21 10:17:23,157 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 68 [2020-09-21 10:17:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:23,158 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2020-09-21 10:17:23,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:17:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2020-09-21 10:17:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-21 10:17:23,160 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:23,160 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:23,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-21 10:17:23,160 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:23,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash 402664390, now seen corresponding path program 6 times [2020-09-21 10:17:23,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:23,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045281757] [2020-09-21 10:17:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-21 10:17:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-21 10:17:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-21 10:17:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 65 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:23,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1045281757] [2020-09-21 10:17:23,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:23,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:17:23,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573062449] [2020-09-21 10:17:23,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:17:23,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:23,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:17:23,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:17:23,334 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 10 states. [2020-09-21 10:17:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:23,490 INFO L93 Difference]: Finished difference Result 244 states and 337 transitions. [2020-09-21 10:17:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:17:23,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2020-09-21 10:17:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:23,493 INFO L225 Difference]: With dead ends: 244 [2020-09-21 10:17:23,493 INFO L226 Difference]: Without dead ends: 166 [2020-09-21 10:17:23,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:17:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-09-21 10:17:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 113. [2020-09-21 10:17:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-09-21 10:17:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 160 transitions. [2020-09-21 10:17:23,510 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 160 transitions. Word has length 69 [2020-09-21 10:17:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:23,510 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 160 transitions. [2020-09-21 10:17:23,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:17:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 160 transitions. [2020-09-21 10:17:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-21 10:17:23,512 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:23,512 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:23,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-21 10:17:23,513 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:23,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:23,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1523768933, now seen corresponding path program 6 times [2020-09-21 10:17:23,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:23,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727705606] [2020-09-21 10:17:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-21 10:17:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-21 10:17:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-21 10:17:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 4 proven. 71 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:23,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727705606] [2020-09-21 10:17:23,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:23,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:17:23,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383541741] [2020-09-21 10:17:23,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:17:23,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:23,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:17:23,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:17:23,752 INFO L87 Difference]: Start difference. First operand 113 states and 160 transitions. Second operand 11 states. [2020-09-21 10:17:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:23,978 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2020-09-21 10:17:23,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:17:23,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2020-09-21 10:17:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:23,982 INFO L225 Difference]: With dead ends: 226 [2020-09-21 10:17:23,982 INFO L226 Difference]: Without dead ends: 151 [2020-09-21 10:17:23,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:17:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-21 10:17:23,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 114. [2020-09-21 10:17:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-09-21 10:17:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2020-09-21 10:17:23,996 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 71 [2020-09-21 10:17:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:23,996 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2020-09-21 10:17:23,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:17:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2020-09-21 10:17:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-21 10:17:23,997 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:23,997 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:23,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-21 10:17:23,998 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash 993224151, now seen corresponding path program 7 times [2020-09-21 10:17:23,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:23,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1148209734] [2020-09-21 10:17:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-09-21 10:17:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-09-21 10:17:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-21 10:17:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:24,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1148209734] [2020-09-21 10:17:24,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:24,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:17:24,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287273800] [2020-09-21 10:17:24,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:17:24,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:24,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:17:24,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:17:24,190 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand 11 states. [2020-09-21 10:17:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:24,310 INFO L93 Difference]: Finished difference Result 261 states and 360 transitions. [2020-09-21 10:17:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:17:24,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-09-21 10:17:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:24,312 INFO L225 Difference]: With dead ends: 261 [2020-09-21 10:17:24,312 INFO L226 Difference]: Without dead ends: 180 [2020-09-21 10:17:24,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:17:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-09-21 10:17:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 119. [2020-09-21 10:17:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-09-21 10:17:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2020-09-21 10:17:24,324 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 72 [2020-09-21 10:17:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:24,325 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2020-09-21 10:17:24,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:17:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2020-09-21 10:17:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-09-21 10:17:24,326 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:24,326 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:24,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-21 10:17:24,327 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2116016182, now seen corresponding path program 7 times [2020-09-21 10:17:24,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:24,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1239070323] [2020-09-21 10:17:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-21 10:17:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-21 10:17:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-21 10:17:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:24,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1239070323] [2020-09-21 10:17:24,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:24,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:17:24,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823386904] [2020-09-21 10:17:24,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:17:24,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:24,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:17:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:17:24,630 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand 12 states. [2020-09-21 10:17:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:24,873 INFO L93 Difference]: Finished difference Result 238 states and 341 transitions. [2020-09-21 10:17:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:17:24,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2020-09-21 10:17:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:24,875 INFO L225 Difference]: With dead ends: 238 [2020-09-21 10:17:24,875 INFO L226 Difference]: Without dead ends: 160 [2020-09-21 10:17:24,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:17:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-09-21 10:17:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2020-09-21 10:17:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-09-21 10:17:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 171 transitions. [2020-09-21 10:17:24,886 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 171 transitions. Word has length 74 [2020-09-21 10:17:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:24,887 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 171 transitions. [2020-09-21 10:17:24,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:17:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 171 transitions. [2020-09-21 10:17:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-09-21 10:17:24,889 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:24,890 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:24,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-21 10:17:24,890 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:24,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:24,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2121947610, now seen corresponding path program 8 times [2020-09-21 10:17:24,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:24,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703672112] [2020-09-21 10:17:24,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:24,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-21 10:17:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-21 10:17:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-21 10:17:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 4 proven. 108 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:25,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1703672112] [2020-09-21 10:17:25,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:25,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:17:25,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335630357] [2020-09-21 10:17:25,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:17:25,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:17:25,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:17:25,089 INFO L87 Difference]: Start difference. First operand 120 states and 171 transitions. Second operand 12 states. [2020-09-21 10:17:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:25,267 INFO L93 Difference]: Finished difference Result 278 states and 383 transitions. [2020-09-21 10:17:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:17:25,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2020-09-21 10:17:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:25,270 INFO L225 Difference]: With dead ends: 278 [2020-09-21 10:17:25,270 INFO L226 Difference]: Without dead ends: 194 [2020-09-21 10:17:25,271 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:17:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-09-21 10:17:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 125. [2020-09-21 10:17:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-09-21 10:17:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 178 transitions. [2020-09-21 10:17:25,286 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 178 transitions. Word has length 75 [2020-09-21 10:17:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:25,287 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 178 transitions. [2020-09-21 10:17:25,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:17:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 178 transitions. [2020-09-21 10:17:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-09-21 10:17:25,289 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:25,289 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:25,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-21 10:17:25,290 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:25,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2028159173, now seen corresponding path program 8 times [2020-09-21 10:17:25,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:25,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1326052485] [2020-09-21 10:17:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-21 10:17:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-21 10:17:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-21 10:17:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 4 proven. 116 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:25,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1326052485] [2020-09-21 10:17:25,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:25,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:17:25,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572464408] [2020-09-21 10:17:25,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:17:25,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:17:25,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:17:25,598 INFO L87 Difference]: Start difference. First operand 125 states and 178 transitions. Second operand 13 states. [2020-09-21 10:17:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:25,882 INFO L93 Difference]: Finished difference Result 250 states and 359 transitions. [2020-09-21 10:17:25,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:17:25,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2020-09-21 10:17:25,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:25,884 INFO L225 Difference]: With dead ends: 250 [2020-09-21 10:17:25,884 INFO L226 Difference]: Without dead ends: 169 [2020-09-21 10:17:25,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:17:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-09-21 10:17:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2020-09-21 10:17:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-09-21 10:17:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2020-09-21 10:17:25,896 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 77 [2020-09-21 10:17:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:25,897 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2020-09-21 10:17:25,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:17:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2020-09-21 10:17:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-21 10:17:25,898 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:25,899 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:25,899 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-21 10:17:25,899 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:25,899 INFO L82 PathProgramCache]: Analyzing trace with hash -550547593, now seen corresponding path program 9 times [2020-09-21 10:17:25,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:25,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [627478943] [2020-09-21 10:17:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:25,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-21 10:17:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-21 10:17:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 4 proven. 134 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:26,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [627478943] [2020-09-21 10:17:26,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:26,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:17:26,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540579232] [2020-09-21 10:17:26,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:17:26,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:26,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:17:26,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:17:26,143 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand 13 states. [2020-09-21 10:17:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:26,296 INFO L93 Difference]: Finished difference Result 295 states and 406 transitions. [2020-09-21 10:17:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:17:26,297 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2020-09-21 10:17:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:26,302 INFO L225 Difference]: With dead ends: 295 [2020-09-21 10:17:26,302 INFO L226 Difference]: Without dead ends: 208 [2020-09-21 10:17:26,303 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:17:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-09-21 10:17:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 131. [2020-09-21 10:17:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-09-21 10:17:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 187 transitions. [2020-09-21 10:17:26,318 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 187 transitions. Word has length 78 [2020-09-21 10:17:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:26,318 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 187 transitions. [2020-09-21 10:17:26,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:17:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 187 transitions. [2020-09-21 10:17:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-21 10:17:26,319 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:26,320 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:26,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-21 10:17:26,320 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:26,320 INFO L82 PathProgramCache]: Analyzing trace with hash 315087318, now seen corresponding path program 9 times [2020-09-21 10:17:26,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:26,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [250900055] [2020-09-21 10:17:26,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-21 10:17:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-21 10:17:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-21 10:17:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 4 proven. 143 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:26,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [250900055] [2020-09-21 10:17:26,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:26,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-21 10:17:26,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045338618] [2020-09-21 10:17:26,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-21 10:17:26,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-21 10:17:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:17:26,634 INFO L87 Difference]: Start difference. First operand 131 states and 187 transitions. Second operand 14 states. [2020-09-21 10:17:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:27,001 INFO L93 Difference]: Finished difference Result 262 states and 377 transitions. [2020-09-21 10:17:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-21 10:17:27,004 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2020-09-21 10:17:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:27,006 INFO L225 Difference]: With dead ends: 262 [2020-09-21 10:17:27,006 INFO L226 Difference]: Without dead ends: 178 [2020-09-21 10:17:27,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:17:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-09-21 10:17:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2020-09-21 10:17:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-09-21 10:17:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2020-09-21 10:17:27,021 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 80 [2020-09-21 10:17:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:27,022 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2020-09-21 10:17:27,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-21 10:17:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2020-09-21 10:17:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-21 10:17:27,023 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:27,023 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:27,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-21 10:17:27,025 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:27,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:27,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2116167546, now seen corresponding path program 10 times [2020-09-21 10:17:27,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:27,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [107015964] [2020-09-21 10:17:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-21 10:17:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-21 10:17:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-21 10:17:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 4 proven. 163 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:27,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [107015964] [2020-09-21 10:17:27,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:27,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-21 10:17:27,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862605481] [2020-09-21 10:17:27,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-21 10:17:27,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:27,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-21 10:17:27,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:17:27,250 INFO L87 Difference]: Start difference. First operand 132 states and 189 transitions. Second operand 14 states. [2020-09-21 10:17:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:27,452 INFO L93 Difference]: Finished difference Result 312 states and 429 transitions. [2020-09-21 10:17:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-21 10:17:27,452 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2020-09-21 10:17:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:27,454 INFO L225 Difference]: With dead ends: 312 [2020-09-21 10:17:27,454 INFO L226 Difference]: Without dead ends: 222 [2020-09-21 10:17:27,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:17:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-09-21 10:17:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 137. [2020-09-21 10:17:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-09-21 10:17:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 196 transitions. [2020-09-21 10:17:27,467 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 196 transitions. Word has length 81 [2020-09-21 10:17:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:27,467 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 196 transitions. [2020-09-21 10:17:27,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-21 10:17:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 196 transitions. [2020-09-21 10:17:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-09-21 10:17:27,468 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:27,468 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:27,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-21 10:17:27,469 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1007133915, now seen corresponding path program 10 times [2020-09-21 10:17:27,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:27,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1411195538] [2020-09-21 10:17:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-21 10:17:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-21 10:17:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-21 10:17:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 4 proven. 173 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:27,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1411195538] [2020-09-21 10:17:27,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:27,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-21 10:17:27,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137679808] [2020-09-21 10:17:27,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-21 10:17:27,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:27,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-21 10:17:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:17:27,844 INFO L87 Difference]: Start difference. First operand 137 states and 196 transitions. Second operand 15 states. [2020-09-21 10:17:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:28,378 INFO L93 Difference]: Finished difference Result 274 states and 395 transitions. [2020-09-21 10:17:28,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:17:28,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2020-09-21 10:17:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:28,381 INFO L225 Difference]: With dead ends: 274 [2020-09-21 10:17:28,381 INFO L226 Difference]: Without dead ends: 187 [2020-09-21 10:17:28,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:17:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-09-21 10:17:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 138. [2020-09-21 10:17:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-09-21 10:17:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 198 transitions. [2020-09-21 10:17:28,397 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 198 transitions. Word has length 83 [2020-09-21 10:17:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:28,397 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 198 transitions. [2020-09-21 10:17:28,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-21 10:17:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 198 transitions. [2020-09-21 10:17:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-09-21 10:17:28,399 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:28,400 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:28,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-21 10:17:28,400 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:28,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash -155352809, now seen corresponding path program 11 times [2020-09-21 10:17:28,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:28,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355291233] [2020-09-21 10:17:28,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:28,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:28,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:28,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:28,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-21 10:17:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:28,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-21 10:17:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:28,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-21 10:17:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 4 proven. 195 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:28,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355291233] [2020-09-21 10:17:28,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:28,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-21 10:17:28,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630435611] [2020-09-21 10:17:28,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-21 10:17:28,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:28,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-21 10:17:28,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:17:28,679 INFO L87 Difference]: Start difference. First operand 138 states and 198 transitions. Second operand 15 states. [2020-09-21 10:17:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:28,830 INFO L93 Difference]: Finished difference Result 329 states and 452 transitions. [2020-09-21 10:17:28,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:17:28,830 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2020-09-21 10:17:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:28,832 INFO L225 Difference]: With dead ends: 329 [2020-09-21 10:17:28,832 INFO L226 Difference]: Without dead ends: 236 [2020-09-21 10:17:28,833 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:17:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-09-21 10:17:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 143. [2020-09-21 10:17:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-09-21 10:17:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2020-09-21 10:17:28,844 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 84 [2020-09-21 10:17:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:28,845 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2020-09-21 10:17:28,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-21 10:17:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2020-09-21 10:17:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-21 10:17:28,846 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:28,846 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:28,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-21 10:17:28,846 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:28,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2140152694, now seen corresponding path program 11 times [2020-09-21 10:17:28,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:28,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1181670416] [2020-09-21 10:17:28,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:28,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:28,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:28,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:29,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-21 10:17:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:29,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:29,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-21 10:17:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 4 proven. 206 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:29,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1181670416] [2020-09-21 10:17:29,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:29,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-21 10:17:29,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982778369] [2020-09-21 10:17:29,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-21 10:17:29,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:29,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-21 10:17:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:17:29,283 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand 16 states. [2020-09-21 10:17:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:29,847 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2020-09-21 10:17:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-21 10:17:29,847 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2020-09-21 10:17:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:29,849 INFO L225 Difference]: With dead ends: 286 [2020-09-21 10:17:29,849 INFO L226 Difference]: Without dead ends: 196 [2020-09-21 10:17:29,850 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:17:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-09-21 10:17:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 144. [2020-09-21 10:17:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-09-21 10:17:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 207 transitions. [2020-09-21 10:17:29,871 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 207 transitions. Word has length 86 [2020-09-21 10:17:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:29,871 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 207 transitions. [2020-09-21 10:17:29,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-21 10:17:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 207 transitions. [2020-09-21 10:17:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-09-21 10:17:29,874 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:29,874 INFO L422 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:29,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-21 10:17:29,874 INFO L427 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:29,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1373715738, now seen corresponding path program 12 times [2020-09-21 10:17:29,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:29,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [920400878] [2020-09-21 10:17:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:29,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:29,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:29,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-21 10:17:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-21 10:17:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-21 10:17:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 4 proven. 230 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:30,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [920400878] [2020-09-21 10:17:30,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:30,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-21 10:17:30,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101411923] [2020-09-21 10:17:30,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-21 10:17:30,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:30,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-21 10:17:30,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:17:30,298 INFO L87 Difference]: Start difference. First operand 144 states and 207 transitions. Second operand 16 states. [2020-09-21 10:17:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:30,543 INFO L93 Difference]: Finished difference Result 346 states and 475 transitions. [2020-09-21 10:17:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-21 10:17:30,544 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2020-09-21 10:17:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:30,546 INFO L225 Difference]: With dead ends: 346 [2020-09-21 10:17:30,546 INFO L226 Difference]: Without dead ends: 250 [2020-09-21 10:17:30,547 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:17:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-09-21 10:17:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2020-09-21 10:17:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-09-21 10:17:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 214 transitions. [2020-09-21 10:17:30,559 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 214 transitions. Word has length 87 [2020-09-21 10:17:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:30,559 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 214 transitions. [2020-09-21 10:17:30,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-21 10:17:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 214 transitions. [2020-09-21 10:17:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-09-21 10:17:30,561 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:30,561 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:30,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-21 10:17:30,561 INFO L427 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:30,562 INFO L82 PathProgramCache]: Analyzing trace with hash -475517563, now seen corresponding path program 12 times [2020-09-21 10:17:30,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:30,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1788006772] [2020-09-21 10:17:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-21 10:17:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-21 10:17:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-21 10:17:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2020-09-21 10:17:30,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1788006772] [2020-09-21 10:17:30,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:17:30,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:17:30,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524937425] [2020-09-21 10:17:30,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:17:30,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:30,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:17:30,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:17:30,640 INFO L87 Difference]: Start difference. First operand 149 states and 214 transitions. Second operand 3 states. [2020-09-21 10:17:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:30,655 INFO L93 Difference]: Finished difference Result 160 states and 227 transitions. [2020-09-21 10:17:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:17:30,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-09-21 10:17:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:30,657 INFO L225 Difference]: With dead ends: 160 [2020-09-21 10:17:30,658 INFO L226 Difference]: Without dead ends: 149 [2020-09-21 10:17:30,658 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:17:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-09-21 10:17:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2020-09-21 10:17:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-09-21 10:17:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 213 transitions. [2020-09-21 10:17:30,669 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 213 transitions. Word has length 89 [2020-09-21 10:17:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:30,669 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 213 transitions. [2020-09-21 10:17:30,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:17:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 213 transitions. [2020-09-21 10:17:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-21 10:17:30,670 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:30,670 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:30,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-21 10:17:30,671 INFO L427 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:30,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash -472997077, now seen corresponding path program 1 times [2020-09-21 10:17:30,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:30,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [522119292] [2020-09-21 10:17:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-21 10:17:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-21 10:17:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-21 10:17:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2020-09-21 10:17:30,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [522119292] [2020-09-21 10:17:30,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:17:30,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:17:30,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811986270] [2020-09-21 10:17:30,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 10:17:30,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:30,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 10:17:30,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 10:17:30,748 INFO L87 Difference]: Start difference. First operand 149 states and 213 transitions. Second operand 4 states. [2020-09-21 10:17:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:30,775 INFO L93 Difference]: Finished difference Result 161 states and 227 transitions. [2020-09-21 10:17:30,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-21 10:17:30,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2020-09-21 10:17:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:30,777 INFO L225 Difference]: With dead ends: 161 [2020-09-21 10:17:30,777 INFO L226 Difference]: Without dead ends: 149 [2020-09-21 10:17:30,777 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:17:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-09-21 10:17:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2020-09-21 10:17:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-09-21 10:17:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 212 transitions. [2020-09-21 10:17:30,788 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 212 transitions. Word has length 91 [2020-09-21 10:17:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:30,788 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 212 transitions. [2020-09-21 10:17:30,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 10:17:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 212 transitions. [2020-09-21 10:17:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-21 10:17:30,790 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:30,790 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:30,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-21 10:17:30,790 INFO L427 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:30,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:30,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1494065431, now seen corresponding path program 1 times [2020-09-21 10:17:30,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:30,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820103891] [2020-09-21 10:17:30,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:30,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:31,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-21 10:17:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:31,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-21 10:17:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:31,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-21 10:17:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 4 proven. 242 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:31,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820103891] [2020-09-21 10:17:31,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:31,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-21 10:17:31,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221497779] [2020-09-21 10:17:31,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-21 10:17:31,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:31,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-21 10:17:31,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:17:31,221 INFO L87 Difference]: Start difference. First operand 149 states and 212 transitions. Second operand 17 states. [2020-09-21 10:17:31,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:31,843 INFO L93 Difference]: Finished difference Result 298 states and 427 transitions. [2020-09-21 10:17:31,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:17:31,844 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2020-09-21 10:17:31,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:31,845 INFO L225 Difference]: With dead ends: 298 [2020-09-21 10:17:31,846 INFO L226 Difference]: Without dead ends: 205 [2020-09-21 10:17:31,847 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:17:31,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-09-21 10:17:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 150. [2020-09-21 10:17:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-09-21 10:17:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 214 transitions. [2020-09-21 10:17:31,860 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 214 transitions. Word has length 91 [2020-09-21 10:17:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:31,861 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 214 transitions. [2020-09-21 10:17:31,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-21 10:17:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2020-09-21 10:17:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-21 10:17:31,862 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:31,862 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:31,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-21 10:17:31,863 INFO L427 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1215060069, now seen corresponding path program 1 times [2020-09-21 10:17:31,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:31,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2118306017] [2020-09-21 10:17:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:31,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:31,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:31,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-21 10:17:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-21 10:17:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-21 10:17:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 268 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:32,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2118306017] [2020-09-21 10:17:32,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:32,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-21 10:17:32,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618794032] [2020-09-21 10:17:32,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-21 10:17:32,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:32,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-21 10:17:32,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:17:32,155 INFO L87 Difference]: Start difference. First operand 150 states and 214 transitions. Second operand 17 states. [2020-09-21 10:17:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:32,368 INFO L93 Difference]: Finished difference Result 363 states and 494 transitions. [2020-09-21 10:17:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:17:32,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 92 [2020-09-21 10:17:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:32,371 INFO L225 Difference]: With dead ends: 363 [2020-09-21 10:17:32,371 INFO L226 Difference]: Without dead ends: 264 [2020-09-21 10:17:32,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:17:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-09-21 10:17:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 155. [2020-09-21 10:17:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-09-21 10:17:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2020-09-21 10:17:32,384 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 92 [2020-09-21 10:17:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:32,384 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2020-09-21 10:17:32,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-21 10:17:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2020-09-21 10:17:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-09-21 10:17:32,386 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:32,386 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:32,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-21 10:17:32,386 INFO L427 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:32,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:32,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1005143610, now seen corresponding path program 2 times [2020-09-21 10:17:32,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:32,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064080984] [2020-09-21 10:17:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-21 10:17:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-21 10:17:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-21 10:17:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 4 proven. 281 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:32,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064080984] [2020-09-21 10:17:32,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:32,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-21 10:17:32,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275808134] [2020-09-21 10:17:32,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-21 10:17:32,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:32,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-21 10:17:32,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:17:32,810 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. Second operand 18 states. [2020-09-21 10:17:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:33,489 INFO L93 Difference]: Finished difference Result 310 states and 445 transitions. [2020-09-21 10:17:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-21 10:17:33,490 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2020-09-21 10:17:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:33,492 INFO L225 Difference]: With dead ends: 310 [2020-09-21 10:17:33,492 INFO L226 Difference]: Without dead ends: 214 [2020-09-21 10:17:33,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:17:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-09-21 10:17:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 156. [2020-09-21 10:17:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-09-21 10:17:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 223 transitions. [2020-09-21 10:17:33,505 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 223 transitions. Word has length 94 [2020-09-21 10:17:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:33,506 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 223 transitions. [2020-09-21 10:17:33,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-21 10:17:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 223 transitions. [2020-09-21 10:17:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-09-21 10:17:33,507 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:33,508 INFO L422 BasicCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:33,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-21 10:17:33,508 INFO L427 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:33,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:33,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1048991126, now seen corresponding path program 2 times [2020-09-21 10:17:33,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:33,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [38304685] [2020-09-21 10:17:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-21 10:17:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-21 10:17:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 4 proven. 309 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:33,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [38304685] [2020-09-21 10:17:33,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:33,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-21 10:17:33,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317515968] [2020-09-21 10:17:33,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-21 10:17:33,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:33,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-21 10:17:33,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:17:33,870 INFO L87 Difference]: Start difference. First operand 156 states and 223 transitions. Second operand 18 states. [2020-09-21 10:17:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:34,072 INFO L93 Difference]: Finished difference Result 380 states and 517 transitions. [2020-09-21 10:17:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-21 10:17:34,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2020-09-21 10:17:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:34,075 INFO L225 Difference]: With dead ends: 380 [2020-09-21 10:17:34,075 INFO L226 Difference]: Without dead ends: 278 [2020-09-21 10:17:34,076 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:17:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-09-21 10:17:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 161. [2020-09-21 10:17:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-09-21 10:17:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2020-09-21 10:17:34,093 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 95 [2020-09-21 10:17:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:34,094 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2020-09-21 10:17:34,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-21 10:17:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2020-09-21 10:17:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-21 10:17:34,095 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:34,096 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:34,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-09-21 10:17:34,096 INFO L427 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1683607881, now seen corresponding path program 3 times [2020-09-21 10:17:34,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:34,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1506795172] [2020-09-21 10:17:34,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-21 10:17:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-21 10:17:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-21 10:17:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 4 proven. 323 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:34,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1506795172] [2020-09-21 10:17:34,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:34,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-21 10:17:34,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685545260] [2020-09-21 10:17:34,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-21 10:17:34,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-21 10:17:34,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:17:34,613 INFO L87 Difference]: Start difference. First operand 161 states and 230 transitions. Second operand 19 states. [2020-09-21 10:17:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:35,347 INFO L93 Difference]: Finished difference Result 322 states and 463 transitions. [2020-09-21 10:17:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-21 10:17:35,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-09-21 10:17:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:35,351 INFO L225 Difference]: With dead ends: 322 [2020-09-21 10:17:35,351 INFO L226 Difference]: Without dead ends: 223 [2020-09-21 10:17:35,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:17:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-09-21 10:17:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 162. [2020-09-21 10:17:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-09-21 10:17:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 232 transitions. [2020-09-21 10:17:35,371 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 232 transitions. Word has length 97 [2020-09-21 10:17:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:35,372 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 232 transitions. [2020-09-21 10:17:35,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-21 10:17:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 232 transitions. [2020-09-21 10:17:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-09-21 10:17:35,374 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:35,374 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:35,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-09-21 10:17:35,375 INFO L427 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1491435205, now seen corresponding path program 3 times [2020-09-21 10:17:35,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:35,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051577344] [2020-09-21 10:17:35,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-21 10:17:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-21 10:17:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-09-21 10:17:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 4 proven. 353 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:35,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051577344] [2020-09-21 10:17:35,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:35,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-21 10:17:35,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270116425] [2020-09-21 10:17:35,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-21 10:17:35,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-21 10:17:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:17:35,754 INFO L87 Difference]: Start difference. First operand 162 states and 232 transitions. Second operand 19 states. [2020-09-21 10:17:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:36,050 INFO L93 Difference]: Finished difference Result 397 states and 540 transitions. [2020-09-21 10:17:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-21 10:17:36,051 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2020-09-21 10:17:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:36,053 INFO L225 Difference]: With dead ends: 397 [2020-09-21 10:17:36,053 INFO L226 Difference]: Without dead ends: 292 [2020-09-21 10:17:36,054 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:17:36,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-09-21 10:17:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 167. [2020-09-21 10:17:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-09-21 10:17:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 239 transitions. [2020-09-21 10:17:36,077 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 239 transitions. Word has length 98 [2020-09-21 10:17:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:36,077 INFO L479 AbstractCegarLoop]: Abstraction has 167 states and 239 transitions. [2020-09-21 10:17:36,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-21 10:17:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 239 transitions. [2020-09-21 10:17:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-09-21 10:17:36,079 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:36,079 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:36,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-09-21 10:17:36,079 INFO L427 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1696610266, now seen corresponding path program 4 times [2020-09-21 10:17:36,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:36,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1936019559] [2020-09-21 10:17:36,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-21 10:17:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-21 10:17:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-21 10:17:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 4 proven. 368 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:36,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1936019559] [2020-09-21 10:17:36,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:36,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-21 10:17:36,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923020422] [2020-09-21 10:17:36,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-21 10:17:36,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:36,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-21 10:17:36,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:17:36,654 INFO L87 Difference]: Start difference. First operand 167 states and 239 transitions. Second operand 20 states. [2020-09-21 10:17:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:37,509 INFO L93 Difference]: Finished difference Result 334 states and 481 transitions. [2020-09-21 10:17:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-21 10:17:37,510 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 100 [2020-09-21 10:17:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:37,512 INFO L225 Difference]: With dead ends: 334 [2020-09-21 10:17:37,512 INFO L226 Difference]: Without dead ends: 232 [2020-09-21 10:17:37,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:17:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-09-21 10:17:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 168. [2020-09-21 10:17:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-09-21 10:17:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2020-09-21 10:17:37,531 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 100 [2020-09-21 10:17:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:37,532 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2020-09-21 10:17:37,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-21 10:17:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2020-09-21 10:17:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-09-21 10:17:37,534 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:37,535 INFO L422 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:37,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-09-21 10:17:37,535 INFO L427 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:37,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1088361270, now seen corresponding path program 4 times [2020-09-21 10:17:37,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:37,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1613827456] [2020-09-21 10:17:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-21 10:17:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-21 10:17:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-21 10:17:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 4 proven. 400 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:37,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1613827456] [2020-09-21 10:17:37,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:37,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-21 10:17:37,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506274126] [2020-09-21 10:17:37,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-21 10:17:37,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:37,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-21 10:17:37,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:17:37,905 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand 20 states. [2020-09-21 10:17:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:38,204 INFO L93 Difference]: Finished difference Result 414 states and 563 transitions. [2020-09-21 10:17:38,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-21 10:17:38,205 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 101 [2020-09-21 10:17:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:38,207 INFO L225 Difference]: With dead ends: 414 [2020-09-21 10:17:38,207 INFO L226 Difference]: Without dead ends: 306 [2020-09-21 10:17:38,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:17:38,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-09-21 10:17:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 173. [2020-09-21 10:17:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-09-21 10:17:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 248 transitions. [2020-09-21 10:17:38,229 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 248 transitions. Word has length 101 [2020-09-21 10:17:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:38,229 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 248 transitions. [2020-09-21 10:17:38,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-21 10:17:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 248 transitions. [2020-09-21 10:17:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-21 10:17:38,230 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:38,231 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:38,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-09-21 10:17:38,231 INFO L427 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:38,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:38,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1791362135, now seen corresponding path program 5 times [2020-09-21 10:17:38,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:38,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2142989679] [2020-09-21 10:17:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-21 10:17:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-21 10:17:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-09-21 10:17:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 4 proven. 416 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:38,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2142989679] [2020-09-21 10:17:38,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:38,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-21 10:17:38,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289213824] [2020-09-21 10:17:38,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-21 10:17:38,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:38,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-21 10:17:38,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:17:38,878 INFO L87 Difference]: Start difference. First operand 173 states and 248 transitions. Second operand 21 states. [2020-09-21 10:17:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:39,677 INFO L93 Difference]: Finished difference Result 346 states and 499 transitions. [2020-09-21 10:17:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-21 10:17:39,677 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2020-09-21 10:17:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:39,679 INFO L225 Difference]: With dead ends: 346 [2020-09-21 10:17:39,680 INFO L226 Difference]: Without dead ends: 241 [2020-09-21 10:17:39,681 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:17:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-09-21 10:17:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 174. [2020-09-21 10:17:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-09-21 10:17:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 250 transitions. [2020-09-21 10:17:39,695 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 250 transitions. Word has length 103 [2020-09-21 10:17:39,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:39,695 INFO L479 AbstractCegarLoop]: Abstraction has 174 states and 250 transitions. [2020-09-21 10:17:39,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-21 10:17:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 250 transitions. [2020-09-21 10:17:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-21 10:17:39,697 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:39,697 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:39,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-09-21 10:17:39,697 INFO L427 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:39,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1841323301, now seen corresponding path program 5 times [2020-09-21 10:17:39,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:39,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1166498780] [2020-09-21 10:17:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:39,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:39,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:39,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:40,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-21 10:17:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:40,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-21 10:17:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:40,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-21 10:17:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 4 proven. 450 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:40,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1166498780] [2020-09-21 10:17:40,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:40,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-21 10:17:40,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30353459] [2020-09-21 10:17:40,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-21 10:17:40,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:40,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-21 10:17:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:17:40,102 INFO L87 Difference]: Start difference. First operand 174 states and 250 transitions. Second operand 21 states. [2020-09-21 10:17:40,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:40,422 INFO L93 Difference]: Finished difference Result 431 states and 586 transitions. [2020-09-21 10:17:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-21 10:17:40,426 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2020-09-21 10:17:40,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:40,428 INFO L225 Difference]: With dead ends: 431 [2020-09-21 10:17:40,429 INFO L226 Difference]: Without dead ends: 320 [2020-09-21 10:17:40,430 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:17:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-09-21 10:17:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 179. [2020-09-21 10:17:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-09-21 10:17:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 257 transitions. [2020-09-21 10:17:40,444 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 257 transitions. Word has length 104 [2020-09-21 10:17:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:40,444 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 257 transitions. [2020-09-21 10:17:40,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-21 10:17:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 257 transitions. [2020-09-21 10:17:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-09-21 10:17:40,446 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:40,446 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:40,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-09-21 10:17:40,446 INFO L427 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash 461599098, now seen corresponding path program 6 times [2020-09-21 10:17:40,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:40,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [312853028] [2020-09-21 10:17:40,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:40,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:40,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:40,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:41,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-21 10:17:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:41,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-21 10:17:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:41,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-21 10:17:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 4 proven. 467 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:41,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [312853028] [2020-09-21 10:17:41,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:41,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-21 10:17:41,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205071255] [2020-09-21 10:17:41,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-21 10:17:41,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:41,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-21 10:17:41,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:17:41,140 INFO L87 Difference]: Start difference. First operand 179 states and 257 transitions. Second operand 22 states. [2020-09-21 10:17:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:42,004 INFO L93 Difference]: Finished difference Result 358 states and 517 transitions. [2020-09-21 10:17:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-21 10:17:42,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 106 [2020-09-21 10:17:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:42,006 INFO L225 Difference]: With dead ends: 358 [2020-09-21 10:17:42,006 INFO L226 Difference]: Without dead ends: 250 [2020-09-21 10:17:42,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2020-09-21 10:17:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-09-21 10:17:42,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 180. [2020-09-21 10:17:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-09-21 10:17:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2020-09-21 10:17:42,021 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 106 [2020-09-21 10:17:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:42,021 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2020-09-21 10:17:42,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-21 10:17:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2020-09-21 10:17:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-09-21 10:17:42,022 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:42,023 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:42,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-09-21 10:17:42,023 INFO L427 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:42,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:42,023 INFO L82 PathProgramCache]: Analyzing trace with hash -719001814, now seen corresponding path program 6 times [2020-09-21 10:17:42,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:42,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1787763278] [2020-09-21 10:17:42,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:42,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:42,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:42,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:42,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-21 10:17:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:42,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-21 10:17:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:42,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:17:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 4 proven. 503 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:42,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1787763278] [2020-09-21 10:17:42,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:42,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-21 10:17:42,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468064463] [2020-09-21 10:17:42,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-21 10:17:42,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:42,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-21 10:17:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:17:42,460 INFO L87 Difference]: Start difference. First operand 180 states and 259 transitions. Second operand 22 states. [2020-09-21 10:17:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:42,747 INFO L93 Difference]: Finished difference Result 448 states and 609 transitions. [2020-09-21 10:17:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-21 10:17:42,749 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2020-09-21 10:17:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:42,752 INFO L225 Difference]: With dead ends: 448 [2020-09-21 10:17:42,752 INFO L226 Difference]: Without dead ends: 334 [2020-09-21 10:17:42,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2020-09-21 10:17:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-09-21 10:17:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 185. [2020-09-21 10:17:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-09-21 10:17:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 266 transitions. [2020-09-21 10:17:42,783 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 266 transitions. Word has length 107 [2020-09-21 10:17:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:42,783 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 266 transitions. [2020-09-21 10:17:42,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-21 10:17:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 266 transitions. [2020-09-21 10:17:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-09-21 10:17:42,784 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:42,785 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:42,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-09-21 10:17:42,785 INFO L427 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:42,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash 975756809, now seen corresponding path program 7 times [2020-09-21 10:17:42,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:42,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [575721668] [2020-09-21 10:17:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:42,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:42,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:42,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:43,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-21 10:17:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:43,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-21 10:17:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:43,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-21 10:17:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 4 proven. 521 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:43,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [575721668] [2020-09-21 10:17:43,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:43,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-21 10:17:43,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608919089] [2020-09-21 10:17:43,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-21 10:17:43,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:43,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-21 10:17:43,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2020-09-21 10:17:43,443 INFO L87 Difference]: Start difference. First operand 185 states and 266 transitions. Second operand 23 states. [2020-09-21 10:17:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:44,422 INFO L93 Difference]: Finished difference Result 370 states and 535 transitions. [2020-09-21 10:17:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-21 10:17:44,422 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 109 [2020-09-21 10:17:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:44,424 INFO L225 Difference]: With dead ends: 370 [2020-09-21 10:17:44,424 INFO L226 Difference]: Without dead ends: 259 [2020-09-21 10:17:44,425 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:17:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-09-21 10:17:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 186. [2020-09-21 10:17:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-09-21 10:17:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 268 transitions. [2020-09-21 10:17:44,441 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 268 transitions. Word has length 109 [2020-09-21 10:17:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:44,441 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 268 transitions. [2020-09-21 10:17:44,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-21 10:17:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 268 transitions. [2020-09-21 10:17:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-09-21 10:17:44,443 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:44,443 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:44,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-09-21 10:17:44,443 INFO L427 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:44,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1959981957, now seen corresponding path program 7 times [2020-09-21 10:17:44,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:44,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [15370666] [2020-09-21 10:17:44,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:44,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:44,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:44,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:44,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-21 10:17:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:44,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-21 10:17:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:44,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-09-21 10:17:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 4 proven. 559 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:44,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [15370666] [2020-09-21 10:17:44,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:44,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-21 10:17:44,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103166900] [2020-09-21 10:17:44,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-21 10:17:44,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:44,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-21 10:17:44,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2020-09-21 10:17:44,960 INFO L87 Difference]: Start difference. First operand 186 states and 268 transitions. Second operand 23 states. [2020-09-21 10:17:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:45,302 INFO L93 Difference]: Finished difference Result 465 states and 632 transitions. [2020-09-21 10:17:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-21 10:17:45,308 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 110 [2020-09-21 10:17:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:45,310 INFO L225 Difference]: With dead ends: 465 [2020-09-21 10:17:45,310 INFO L226 Difference]: Without dead ends: 348 [2020-09-21 10:17:45,311 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:17:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-09-21 10:17:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 191. [2020-09-21 10:17:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-09-21 10:17:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 275 transitions. [2020-09-21 10:17:45,327 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 275 transitions. Word has length 110 [2020-09-21 10:17:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:45,328 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 275 transitions. [2020-09-21 10:17:45,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-21 10:17:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 275 transitions. [2020-09-21 10:17:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-21 10:17:45,329 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:45,329 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:45,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-09-21 10:17:45,329 INFO L427 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:45,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1900219622, now seen corresponding path program 8 times [2020-09-21 10:17:45,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:45,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1952608115] [2020-09-21 10:17:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:45,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:45,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:45,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:45,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-21 10:17:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:45,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-21 10:17:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:45,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-21 10:17:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 4 proven. 578 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:46,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1952608115] [2020-09-21 10:17:46,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:46,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-21 10:17:46,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348802608] [2020-09-21 10:17:46,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-21 10:17:46,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:46,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-21 10:17:46,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:17:46,026 INFO L87 Difference]: Start difference. First operand 191 states and 275 transitions. Second operand 24 states. [2020-09-21 10:17:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:47,319 INFO L93 Difference]: Finished difference Result 382 states and 553 transitions. [2020-09-21 10:17:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-21 10:17:47,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2020-09-21 10:17:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:47,321 INFO L225 Difference]: With dead ends: 382 [2020-09-21 10:17:47,321 INFO L226 Difference]: Without dead ends: 268 [2020-09-21 10:17:47,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2020-09-21 10:17:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-09-21 10:17:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 192. [2020-09-21 10:17:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-09-21 10:17:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 277 transitions. [2020-09-21 10:17:47,339 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 277 transitions. Word has length 112 [2020-09-21 10:17:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:47,340 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 277 transitions. [2020-09-21 10:17:47,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-21 10:17:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 277 transitions. [2020-09-21 10:17:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-21 10:17:47,341 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:47,341 INFO L422 BasicCegarLoop]: trace histogram [21, 20, 20, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:47,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-09-21 10:17:47,342 INFO L427 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash -920938102, now seen corresponding path program 8 times [2020-09-21 10:17:47,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:47,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [934704908] [2020-09-21 10:17:47,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:47,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:47,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:47,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:47,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-21 10:17:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:47,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-09-21 10:17:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:47,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-21 10:17:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 4 proven. 618 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:47,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [934704908] [2020-09-21 10:17:47,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:47,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-21 10:17:47,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589816983] [2020-09-21 10:17:47,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-21 10:17:47,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:47,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-21 10:17:47,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:17:47,869 INFO L87 Difference]: Start difference. First operand 192 states and 277 transitions. Second operand 24 states. [2020-09-21 10:17:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:48,259 INFO L93 Difference]: Finished difference Result 482 states and 655 transitions. [2020-09-21 10:17:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-21 10:17:48,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 113 [2020-09-21 10:17:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:48,265 INFO L225 Difference]: With dead ends: 482 [2020-09-21 10:17:48,265 INFO L226 Difference]: Without dead ends: 362 [2020-09-21 10:17:48,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2020-09-21 10:17:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-09-21 10:17:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 197. [2020-09-21 10:17:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-09-21 10:17:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 284 transitions. [2020-09-21 10:17:48,287 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 284 transitions. Word has length 113 [2020-09-21 10:17:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:48,287 INFO L479 AbstractCegarLoop]: Abstraction has 197 states and 284 transitions. [2020-09-21 10:17:48,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-21 10:17:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 284 transitions. [2020-09-21 10:17:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-09-21 10:17:48,289 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:48,289 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:48,289 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-09-21 10:17:48,289 INFO L427 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:48,290 INFO L82 PathProgramCache]: Analyzing trace with hash 188512361, now seen corresponding path program 9 times [2020-09-21 10:17:48,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:48,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1676809393] [2020-09-21 10:17:48,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:48,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:48,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:48,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:49,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-09-21 10:17:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:49,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-21 10:17:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:49,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-21 10:17:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 4 proven. 638 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:49,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1676809393] [2020-09-21 10:17:49,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:49,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-21 10:17:49,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551042313] [2020-09-21 10:17:49,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-21 10:17:49,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:49,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-21 10:17:49,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2020-09-21 10:17:49,083 INFO L87 Difference]: Start difference. First operand 197 states and 284 transitions. Second operand 25 states. [2020-09-21 10:17:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:50,466 INFO L93 Difference]: Finished difference Result 394 states and 571 transitions. [2020-09-21 10:17:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-21 10:17:50,473 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 115 [2020-09-21 10:17:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:50,476 INFO L225 Difference]: With dead ends: 394 [2020-09-21 10:17:50,476 INFO L226 Difference]: Without dead ends: 277 [2020-09-21 10:17:50,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2020-09-21 10:17:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-09-21 10:17:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 198. [2020-09-21 10:17:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-09-21 10:17:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 286 transitions. [2020-09-21 10:17:50,503 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 286 transitions. Word has length 115 [2020-09-21 10:17:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:50,504 INFO L479 AbstractCegarLoop]: Abstraction has 198 states and 286 transitions. [2020-09-21 10:17:50,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-21 10:17:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 286 transitions. [2020-09-21 10:17:50,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-09-21 10:17:50,505 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:50,505 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:50,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-09-21 10:17:50,505 INFO L427 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:50,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash -594756069, now seen corresponding path program 9 times [2020-09-21 10:17:50,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:50,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [151811210] [2020-09-21 10:17:50,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:50,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:50,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:50,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:51,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-21 10:17:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:51,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-21 10:17:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:51,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-21 10:17:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 4 proven. 680 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:51,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [151811210] [2020-09-21 10:17:51,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:51,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-21 10:17:51,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022519536] [2020-09-21 10:17:51,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-21 10:17:51,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:51,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-21 10:17:51,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2020-09-21 10:17:51,092 INFO L87 Difference]: Start difference. First operand 198 states and 286 transitions. Second operand 25 states. [2020-09-21 10:17:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:51,459 INFO L93 Difference]: Finished difference Result 499 states and 678 transitions. [2020-09-21 10:17:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-21 10:17:51,460 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 116 [2020-09-21 10:17:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:51,462 INFO L225 Difference]: With dead ends: 499 [2020-09-21 10:17:51,462 INFO L226 Difference]: Without dead ends: 376 [2020-09-21 10:17:51,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2020-09-21 10:17:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-09-21 10:17:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 203. [2020-09-21 10:17:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-09-21 10:17:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 293 transitions. [2020-09-21 10:17:51,482 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 293 transitions. Word has length 116 [2020-09-21 10:17:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:51,483 INFO L479 AbstractCegarLoop]: Abstraction has 203 states and 293 transitions. [2020-09-21 10:17:51,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-21 10:17:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 293 transitions. [2020-09-21 10:17:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-21 10:17:51,484 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:51,484 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:51,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-09-21 10:17:51,485 INFO L427 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:51,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash 116833466, now seen corresponding path program 10 times [2020-09-21 10:17:51,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:51,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [814796768] [2020-09-21 10:17:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:51,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:51,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:51,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:52,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-21 10:17:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:52,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-21 10:17:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:52,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-21 10:17:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 4 proven. 701 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:52,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [814796768] [2020-09-21 10:17:52,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:52,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-21 10:17:52,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782970182] [2020-09-21 10:17:52,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-21 10:17:52,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-21 10:17:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2020-09-21 10:17:52,322 INFO L87 Difference]: Start difference. First operand 203 states and 293 transitions. Second operand 26 states. [2020-09-21 10:17:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:53,813 INFO L93 Difference]: Finished difference Result 406 states and 589 transitions. [2020-09-21 10:17:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-21 10:17:53,814 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2020-09-21 10:17:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:53,816 INFO L225 Difference]: With dead ends: 406 [2020-09-21 10:17:53,816 INFO L226 Difference]: Without dead ends: 286 [2020-09-21 10:17:53,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2020-09-21 10:17:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-09-21 10:17:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 204. [2020-09-21 10:17:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-09-21 10:17:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 295 transitions. [2020-09-21 10:17:53,836 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 295 transitions. Word has length 118 [2020-09-21 10:17:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:53,837 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 295 transitions. [2020-09-21 10:17:53,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-21 10:17:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 295 transitions. [2020-09-21 10:17:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-09-21 10:17:53,838 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:53,839 INFO L422 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:53,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-09-21 10:17:53,839 INFO L427 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1478165482, now seen corresponding path program 10 times [2020-09-21 10:17:53,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:53,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [889599784] [2020-09-21 10:17:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-21 10:17:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-21 10:17:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:17:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 4 proven. 745 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:54,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [889599784] [2020-09-21 10:17:54,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:54,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-21 10:17:54,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889364476] [2020-09-21 10:17:54,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-21 10:17:54,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:54,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-21 10:17:54,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2020-09-21 10:17:54,498 INFO L87 Difference]: Start difference. First operand 204 states and 295 transitions. Second operand 26 states. [2020-09-21 10:17:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:54,810 INFO L93 Difference]: Finished difference Result 516 states and 701 transitions. [2020-09-21 10:17:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-21 10:17:54,810 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 119 [2020-09-21 10:17:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:54,812 INFO L225 Difference]: With dead ends: 516 [2020-09-21 10:17:54,813 INFO L226 Difference]: Without dead ends: 390 [2020-09-21 10:17:54,813 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2020-09-21 10:17:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2020-09-21 10:17:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 209. [2020-09-21 10:17:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-09-21 10:17:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 302 transitions. [2020-09-21 10:17:54,832 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 302 transitions. Word has length 119 [2020-09-21 10:17:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:54,832 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 302 transitions. [2020-09-21 10:17:54,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-21 10:17:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 302 transitions. [2020-09-21 10:17:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-21 10:17:54,834 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:54,834 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:54,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-09-21 10:17:54,834 INFO L427 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash -670381367, now seen corresponding path program 11 times [2020-09-21 10:17:54,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:54,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [26375339] [2020-09-21 10:17:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-21 10:17:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-21 10:17:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-21 10:17:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 4 proven. 767 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:55,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [26375339] [2020-09-21 10:17:55,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:55,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-21 10:17:55,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32102251] [2020-09-21 10:17:55,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-21 10:17:55,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:55,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-21 10:17:55,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2020-09-21 10:17:55,708 INFO L87 Difference]: Start difference. First operand 209 states and 302 transitions. Second operand 27 states. [2020-09-21 10:17:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:57,327 INFO L93 Difference]: Finished difference Result 418 states and 607 transitions. [2020-09-21 10:17:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-21 10:17:57,328 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 121 [2020-09-21 10:17:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:57,329 INFO L225 Difference]: With dead ends: 418 [2020-09-21 10:17:57,329 INFO L226 Difference]: Without dead ends: 295 [2020-09-21 10:17:57,330 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2020-09-21 10:17:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-09-21 10:17:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 210. [2020-09-21 10:17:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-09-21 10:17:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 304 transitions. [2020-09-21 10:17:57,348 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 304 transitions. Word has length 121 [2020-09-21 10:17:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:57,349 INFO L479 AbstractCegarLoop]: Abstraction has 210 states and 304 transitions. [2020-09-21 10:17:57,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-21 10:17:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 304 transitions. [2020-09-21 10:17:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-09-21 10:17:57,350 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:57,350 INFO L422 BasicCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:57,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-09-21 10:17:57,350 INFO L427 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:57,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:57,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1450657861, now seen corresponding path program 11 times [2020-09-21 10:17:57,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:57,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1249188188] [2020-09-21 10:17:57,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-21 10:17:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-21 10:17:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-09-21 10:17:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 4 proven. 813 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-21 10:17:58,000 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1249188188] [2020-09-21 10:17:58,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:58,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-21 10:17:58,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51502763] [2020-09-21 10:17:58,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-21 10:17:58,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:58,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-21 10:17:58,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2020-09-21 10:17:58,002 INFO L87 Difference]: Start difference. First operand 210 states and 304 transitions. Second operand 27 states. [2020-09-21 10:17:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:58,469 INFO L93 Difference]: Finished difference Result 533 states and 724 transitions. [2020-09-21 10:17:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-21 10:17:58,469 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2020-09-21 10:17:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:58,472 INFO L225 Difference]: With dead ends: 533 [2020-09-21 10:17:58,472 INFO L226 Difference]: Without dead ends: 404 [2020-09-21 10:17:58,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2020-09-21 10:17:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2020-09-21 10:17:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 215. [2020-09-21 10:17:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-09-21 10:17:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 311 transitions. [2020-09-21 10:17:58,492 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 311 transitions. Word has length 122 [2020-09-21 10:17:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:58,493 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 311 transitions. [2020-09-21 10:17:58,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-21 10:17:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 311 transitions. [2020-09-21 10:17:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-09-21 10:17:58,494 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:58,495 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:58,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-09-21 10:17:58,495 INFO L427 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2066035110, now seen corresponding path program 12 times [2020-09-21 10:17:58,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:58,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [431885544] [2020-09-21 10:17:58,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:17:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-21 10:17:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-21 10:17:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2020-09-21 10:17:58,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [431885544] [2020-09-21 10:17:58,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:17:58,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-21 10:17:58,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056348392] [2020-09-21 10:17:58,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:17:58,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:58,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:17:58,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:17:58,713 INFO L87 Difference]: Start difference. First operand 215 states and 311 transitions. Second operand 10 states. [2020-09-21 10:17:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:58,947 INFO L93 Difference]: Finished difference Result 271 states and 393 transitions. [2020-09-21 10:17:58,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:17:58,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2020-09-21 10:17:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:58,950 INFO L225 Difference]: With dead ends: 271 [2020-09-21 10:17:58,951 INFO L226 Difference]: Without dead ends: 261 [2020-09-21 10:17:58,951 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:17:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-09-21 10:17:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 241. [2020-09-21 10:17:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-09-21 10:17:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 355 transitions. [2020-09-21 10:17:58,977 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 355 transitions. Word has length 124 [2020-09-21 10:17:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:58,977 INFO L479 AbstractCegarLoop]: Abstraction has 241 states and 355 transitions. [2020-09-21 10:17:58,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:17:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 355 transitions. [2020-09-21 10:17:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-09-21 10:17:58,979 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:58,979 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:58,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-09-21 10:17:58,979 INFO L427 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:58,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:58,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1807869672, now seen corresponding path program 1 times [2020-09-21 10:17:58,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:58,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [707365054] [2020-09-21 10:17:58,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:17:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-21 10:17:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-21 10:17:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2020-09-21 10:17:59,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [707365054] [2020-09-21 10:17:59,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:59,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:17:59,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379407414] [2020-09-21 10:17:59,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:17:59,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:59,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:17:59,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:17:59,271 INFO L87 Difference]: Start difference. First operand 241 states and 355 transitions. Second operand 10 states. [2020-09-21 10:17:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:59,512 INFO L93 Difference]: Finished difference Result 285 states and 429 transitions. [2020-09-21 10:17:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:17:59,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2020-09-21 10:17:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:59,517 INFO L225 Difference]: With dead ends: 285 [2020-09-21 10:17:59,517 INFO L226 Difference]: Without dead ends: 280 [2020-09-21 10:17:59,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:17:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-09-21 10:17:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 265. [2020-09-21 10:17:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-09-21 10:17:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2020-09-21 10:17:59,548 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 124 [2020-09-21 10:17:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:59,549 INFO L479 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2020-09-21 10:17:59,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:17:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2020-09-21 10:17:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-21 10:17:59,551 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:59,551 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:59,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-09-21 10:17:59,552 INFO L427 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:59,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1864277052, now seen corresponding path program 1 times [2020-09-21 10:17:59,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:59,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [384181082] [2020-09-21 10:17:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:17:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:17:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-21 10:17:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-21 10:17:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2020-09-21 10:17:59,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [384181082] [2020-09-21 10:17:59,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:17:59,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 10:17:59,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208388842] [2020-09-21 10:17:59,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:17:59,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:59,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:17:59,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:59,703 INFO L87 Difference]: Start difference. First operand 265 states and 402 transitions. Second operand 6 states. [2020-09-21 10:17:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:59,756 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2020-09-21 10:17:59,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:17:59,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2020-09-21 10:17:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:59,759 INFO L225 Difference]: With dead ends: 271 [2020-09-21 10:17:59,759 INFO L226 Difference]: Without dead ends: 265 [2020-09-21 10:17:59,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:17:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-09-21 10:17:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2020-09-21 10:17:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-09-21 10:17:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 401 transitions. [2020-09-21 10:17:59,790 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 401 transitions. Word has length 126 [2020-09-21 10:17:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:59,791 INFO L479 AbstractCegarLoop]: Abstraction has 265 states and 401 transitions. [2020-09-21 10:17:59,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:17:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 401 transitions. [2020-09-21 10:17:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-21 10:17:59,793 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:59,793 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:59,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-09-21 10:17:59,793 INFO L427 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:59,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1807018750, now seen corresponding path program 1 times [2020-09-21 10:17:59,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:59,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [655019256] [2020-09-21 10:17:59,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:18:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:18:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-21 10:18:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-21 10:18:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2020-09-21 10:18:00,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [655019256] [2020-09-21 10:18:00,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:18:00,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:18:00,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982575356] [2020-09-21 10:18:00,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:18:00,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:18:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:18:00,170 INFO L87 Difference]: Start difference. First operand 265 states and 401 transitions. Second operand 12 states. [2020-09-21 10:18:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:00,422 INFO L93 Difference]: Finished difference Result 284 states and 423 transitions. [2020-09-21 10:18:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:18:00,423 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 126 [2020-09-21 10:18:00,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:00,425 INFO L225 Difference]: With dead ends: 284 [2020-09-21 10:18:00,425 INFO L226 Difference]: Without dead ends: 274 [2020-09-21 10:18:00,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:18:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-09-21 10:18:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2020-09-21 10:18:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-09-21 10:18:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 408 transitions. [2020-09-21 10:18:00,455 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 408 transitions. Word has length 126 [2020-09-21 10:18:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:00,456 INFO L479 AbstractCegarLoop]: Abstraction has 271 states and 408 transitions. [2020-09-21 10:18:00,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:18:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 408 transitions. [2020-09-21 10:18:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-09-21 10:18:00,458 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:00,458 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:00,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-09-21 10:18:00,458 INFO L427 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:00,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:00,459 INFO L82 PathProgramCache]: Analyzing trace with hash -93481782, now seen corresponding path program 1 times [2020-09-21 10:18:00,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:00,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1756871067] [2020-09-21 10:18:00,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:18:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:18:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:18:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-21 10:18:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-21 10:18:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2020-09-21 10:18:00,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1756871067] [2020-09-21 10:18:00,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:18:00,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-21 10:18:00,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105926793] [2020-09-21 10:18:00,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:18:00,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:00,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:18:00,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:18:00,659 INFO L87 Difference]: Start difference. First operand 271 states and 408 transitions. Second operand 8 states. [2020-09-21 10:18:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:00,793 INFO L93 Difference]: Finished difference Result 303 states and 449 transitions. [2020-09-21 10:18:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:18:00,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2020-09-21 10:18:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:00,798 INFO L225 Difference]: With dead ends: 303 [2020-09-21 10:18:00,798 INFO L226 Difference]: Without dead ends: 280 [2020-09-21 10:18:00,799 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:18:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-09-21 10:18:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 253. [2020-09-21 10:18:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-09-21 10:18:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 367 transitions. [2020-09-21 10:18:00,830 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 367 transitions. Word has length 127 [2020-09-21 10:18:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:00,830 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 367 transitions. [2020-09-21 10:18:00,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:18:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 367 transitions. [2020-09-21 10:18:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-21 10:18:00,832 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:00,832 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:00,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-09-21 10:18:00,832 INFO L427 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:00,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2078176781, now seen corresponding path program 1 times [2020-09-21 10:18:00,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:00,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1656455418] [2020-09-21 10:18:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:18:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-21 10:18:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-21 10:18:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-21 10:18:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-09-21 10:18:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2020-09-21 10:18:00,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1656455418] [2020-09-21 10:18:00,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:18:00,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 10:18:00,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327299939] [2020-09-21 10:18:00,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:18:00,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:00,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:18:00,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:18:00,987 INFO L87 Difference]: Start difference. First operand 253 states and 367 transitions. Second operand 5 states. [2020-09-21 10:18:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:01,079 INFO L93 Difference]: Finished difference Result 409 states and 589 transitions. [2020-09-21 10:18:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:18:01,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2020-09-21 10:18:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:01,081 INFO L225 Difference]: With dead ends: 409 [2020-09-21 10:18:01,081 INFO L226 Difference]: Without dead ends: 155 [2020-09-21 10:18:01,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:18:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-09-21 10:18:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 140. [2020-09-21 10:18:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-21 10:18:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 202 transitions. [2020-09-21 10:18:01,099 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 202 transitions. Word has length 128 [2020-09-21 10:18:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:01,100 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 202 transitions. [2020-09-21 10:18:01,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:18:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 202 transitions. [2020-09-21 10:18:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-09-21 10:18:01,101 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:01,101 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:01,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-09-21 10:18:01,101 INFO L427 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash 273720313, now seen corresponding path program 1 times [2020-09-21 10:18:01,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:01,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [673008133] [2020-09-21 10:18:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:18:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:18:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:18:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-21 10:18:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-09-21 10:18:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2020-09-21 10:18:01,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [673008133] [2020-09-21 10:18:01,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:18:01,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:18:01,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718722114] [2020-09-21 10:18:01,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:18:01,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:18:01,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:18:01,327 INFO L87 Difference]: Start difference. First operand 140 states and 202 transitions. Second operand 9 states. [2020-09-21 10:18:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:01,460 INFO L93 Difference]: Finished difference Result 173 states and 242 transitions. [2020-09-21 10:18:01,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:18:01,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2020-09-21 10:18:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:01,462 INFO L225 Difference]: With dead ends: 173 [2020-09-21 10:18:01,462 INFO L226 Difference]: Without dead ends: 163 [2020-09-21 10:18:01,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:18:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-09-21 10:18:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2020-09-21 10:18:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-09-21 10:18:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 226 transitions. [2020-09-21 10:18:01,481 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 226 transitions. Word has length 131 [2020-09-21 10:18:01,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:01,482 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 226 transitions. [2020-09-21 10:18:01,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:18:01,482 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 226 transitions. [2020-09-21 10:18:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-09-21 10:18:01,483 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:01,484 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:01,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-09-21 10:18:01,484 INFO L427 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:01,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1006143365, now seen corresponding path program 1 times [2020-09-21 10:18:01,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:01,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156244081] [2020-09-21 10:18:01,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:18:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:18:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:18:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-21 10:18:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-09-21 10:18:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2020-09-21 10:18:01,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156244081] [2020-09-21 10:18:01,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:18:01,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:18:01,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686683564] [2020-09-21 10:18:01,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:18:01,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:01,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:18:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:18:01,816 INFO L87 Difference]: Start difference. First operand 157 states and 226 transitions. Second operand 13 states. [2020-09-21 10:18:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:02,087 INFO L93 Difference]: Finished difference Result 175 states and 246 transitions. [2020-09-21 10:18:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-21 10:18:02,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2020-09-21 10:18:02,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:02,089 INFO L225 Difference]: With dead ends: 175 [2020-09-21 10:18:02,090 INFO L226 Difference]: Without dead ends: 150 [2020-09-21 10:18:02,090 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:18:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-09-21 10:18:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2020-09-21 10:18:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-09-21 10:18:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2020-09-21 10:18:02,104 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 131 [2020-09-21 10:18:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:02,105 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2020-09-21 10:18:02,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:18:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2020-09-21 10:18:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-21 10:18:02,106 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:02,107 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:02,107 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-09-21 10:18:02,107 INFO L427 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:02,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1204770984, now seen corresponding path program 2 times [2020-09-21 10:18:02,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:02,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1380931302] [2020-09-21 10:18:02,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:18:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:18:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:18:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-21 10:18:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-21 10:18:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2020-09-21 10:18:02,395 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1380931302] [2020-09-21 10:18:02,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:18:02,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-21 10:18:02,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611733502] [2020-09-21 10:18:02,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:18:02,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:02,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:18:02,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:18:02,397 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand 11 states. [2020-09-21 10:18:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:02,594 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2020-09-21 10:18:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:18:02,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2020-09-21 10:18:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:02,596 INFO L225 Difference]: With dead ends: 184 [2020-09-21 10:18:02,596 INFO L226 Difference]: Without dead ends: 174 [2020-09-21 10:18:02,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:18:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-09-21 10:18:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2020-09-21 10:18:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-09-21 10:18:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 202 transitions. [2020-09-21 10:18:02,615 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 202 transitions. Word has length 135 [2020-09-21 10:18:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:02,617 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 202 transitions. [2020-09-21 10:18:02,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:18:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2020-09-21 10:18:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-21 10:18:02,621 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:02,621 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:02,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-09-21 10:18:02,622 INFO L427 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:02,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:02,622 INFO L82 PathProgramCache]: Analyzing trace with hash -75092694, now seen corresponding path program 2 times [2020-09-21 10:18:02,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:02,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2080416431] [2020-09-21 10:18:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:18:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:18:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:18:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-21 10:18:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-21 10:18:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2020-09-21 10:18:02,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2080416431] [2020-09-21 10:18:02,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:18:02,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:18:02,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30282004] [2020-09-21 10:18:02,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:18:02,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:02,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:18:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:18:02,938 INFO L87 Difference]: Start difference. First operand 157 states and 202 transitions. Second operand 11 states. [2020-09-21 10:18:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:03,139 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2020-09-21 10:18:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:18:03,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2020-09-21 10:18:03,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:03,141 INFO L225 Difference]: With dead ends: 194 [2020-09-21 10:18:03,142 INFO L226 Difference]: Without dead ends: 150 [2020-09-21 10:18:03,142 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:18:03,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-09-21 10:18:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 140. [2020-09-21 10:18:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-21 10:18:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 176 transitions. [2020-09-21 10:18:03,161 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 176 transitions. Word has length 135 [2020-09-21 10:18:03,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:03,162 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 176 transitions. [2020-09-21 10:18:03,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:18:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 176 transitions. [2020-09-21 10:18:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-21 10:18:03,163 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:03,163 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:03,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-09-21 10:18:03,164 INFO L427 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:03,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:03,165 INFO L82 PathProgramCache]: Analyzing trace with hash 681202148, now seen corresponding path program 1 times [2020-09-21 10:18:03,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:03,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1436674831] [2020-09-21 10:18:03,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:18:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:18:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:18:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-21 10:18:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-21 10:18:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2020-09-21 10:18:03,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1436674831] [2020-09-21 10:18:03,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:18:03,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:18:03,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651813952] [2020-09-21 10:18:03,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:18:03,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:03,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:18:03,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:18:03,452 INFO L87 Difference]: Start difference. First operand 140 states and 176 transitions. Second operand 10 states. [2020-09-21 10:18:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:03,629 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2020-09-21 10:18:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:18:03,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2020-09-21 10:18:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:03,631 INFO L225 Difference]: With dead ends: 160 [2020-09-21 10:18:03,631 INFO L226 Difference]: Without dead ends: 140 [2020-09-21 10:18:03,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:18:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-09-21 10:18:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-09-21 10:18:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-21 10:18:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 175 transitions. [2020-09-21 10:18:03,648 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 175 transitions. Word has length 135 [2020-09-21 10:18:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:03,649 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 175 transitions. [2020-09-21 10:18:03,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:18:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 175 transitions. [2020-09-21 10:18:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-21 10:18:03,650 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:03,650 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:03,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-09-21 10:18:03,651 INFO L427 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash -598661530, now seen corresponding path program 1 times [2020-09-21 10:18:03,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:03,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [642482535] [2020-09-21 10:18:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:18:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:18:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:18:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-21 10:18:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-21 10:18:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2020-09-21 10:18:04,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [642482535] [2020-09-21 10:18:04,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:18:04,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:18:04,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591111789] [2020-09-21 10:18:04,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:18:04,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:18:04,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:18:04,042 INFO L87 Difference]: Start difference. First operand 140 states and 175 transitions. Second operand 13 states. [2020-09-21 10:18:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:04,311 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2020-09-21 10:18:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:18:04,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 135 [2020-09-21 10:18:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:04,314 INFO L225 Difference]: With dead ends: 155 [2020-09-21 10:18:04,314 INFO L226 Difference]: Without dead ends: 137 [2020-09-21 10:18:04,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:18:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-09-21 10:18:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-09-21 10:18:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-09-21 10:18:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 171 transitions. [2020-09-21 10:18:04,330 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 171 transitions. Word has length 135 [2020-09-21 10:18:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:04,330 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 171 transitions. [2020-09-21 10:18:04,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:18:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2020-09-21 10:18:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-21 10:18:04,331 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:04,332 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:04,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-09-21 10:18:04,332 INFO L427 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:04,332 INFO L82 PathProgramCache]: Analyzing trace with hash -114976086, now seen corresponding path program 1 times [2020-09-21 10:18:04,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:04,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1737655394] [2020-09-21 10:18:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:04,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:18:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:04,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:04,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:18:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:04,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-21 10:18:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:04,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-21 10:18:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:04,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-21 10:18:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2020-09-21 10:18:04,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1737655394] [2020-09-21 10:18:04,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:18:04,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:18:04,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502183804] [2020-09-21 10:18:04,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:18:04,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:04,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:18:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:18:04,664 INFO L87 Difference]: Start difference. First operand 137 states and 171 transitions. Second operand 10 states. [2020-09-21 10:18:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:04,815 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2020-09-21 10:18:04,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:18:04,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2020-09-21 10:18:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:04,816 INFO L225 Difference]: With dead ends: 137 [2020-09-21 10:18:04,816 INFO L226 Difference]: Without dead ends: 0 [2020-09-21 10:18:04,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:18:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-21 10:18:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-21 10:18:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-21 10:18:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-21 10:18:04,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2020-09-21 10:18:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:04,821 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-21 10:18:04,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:18:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-21 10:18:04,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-21 10:18:04,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2020-09-21 10:18:04,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-21 10:18:06,034 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 598 DAG size of output: 136