/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.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:37:25,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:37:25,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:37:25,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:37:25,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:37:25,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:37:25,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:37:25,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:37:25,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:37:25,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:37:25,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:37:25,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:37:25,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:37:25,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:37:25,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:37:25,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:37:25,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:37:25,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:37:25,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:37:25,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:37:25,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:37:25,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:37:25,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:37:25,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:37:25,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:37:25,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:37:25,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:37:25,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:37:25,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:37:25,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:37:25,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:37:25,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:37:25,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:37:25,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:37:25,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:37:25,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:37:25,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:37:25,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:37:25,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:37:25,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:37:25,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:37:25,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:37:25,984 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:37:25,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:37:25,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:37:25,987 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:37:25,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:37:25,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:37:25,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:37:25,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:37:25,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:37:25,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:37:25,989 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:37:25,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:37:25,990 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:37:25,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:37:25,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:37:25,991 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:37:25,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:37:25,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:37:25,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:37:25,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:37:25,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:37:25,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:37:25,992 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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: Use separate solver for trace checks -> true [2020-09-04 21:37:26,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:37:26,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:37:26,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:37:26,443 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:37:26,444 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:37:26,445 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-04 21:37:26,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ad5f4bbcb/faeee621a6f84a6682ef5d1385425b4b/FLAG3a752daa2 [2020-09-04 21:37:27,126 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:37:27,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2020-09-04 21:37:27,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ad5f4bbcb/faeee621a6f84a6682ef5d1385425b4b/FLAG3a752daa2 [2020-09-04 21:37:27,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ad5f4bbcb/faeee621a6f84a6682ef5d1385425b4b [2020-09-04 21:37:27,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:37:27,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:37:27,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:37:27,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:37:27,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:37:27,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:37:27" (1/1) ... [2020-09-04 21:37:27,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321fecde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27, skipping insertion in model container [2020-09-04 21:37:27,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:37:27" (1/1) ... [2020-09-04 21:37:27,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:37:27,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:37:27,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:37:27,769 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:37:27,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:37:27,931 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:37:27,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27 WrapperNode [2020-09-04 21:37:27,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:37:27,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:37:27,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:37:27,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:37:27,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27" (1/1) ... [2020-09-04 21:37:27,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27" (1/1) ... [2020-09-04 21:37:27,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27" (1/1) ... [2020-09-04 21:37:27,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27" (1/1) ... [2020-09-04 21:37:27,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27" (1/1) ... [2020-09-04 21:37:27,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27" (1/1) ... [2020-09-04 21:37:27,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27" (1/1) ... [2020-09-04 21:37:27,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:37:27,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:37:27,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:37:27,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:37:27,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27" (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-04 21:37:28,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:37:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:37:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 21:37:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2020-09-04 21:37:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2020-09-04 21:37:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2020-09-04 21:37:28,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:37:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:37:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-04 21:37:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 21:37:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 21:37:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2020-09-04 21:37:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2020-09-04 21:37:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2020-09-04 21:37:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:37:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:37:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:37:28,565 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:37:28,565 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 21:37:28,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:37:28 BoogieIcfgContainer [2020-09-04 21:37:28,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:37:28,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:37:28,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:37:28,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:37:28,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:37:27" (1/3) ... [2020-09-04 21:37:28,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e238783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:37:28, skipping insertion in model container [2020-09-04 21:37:28,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:27" (2/3) ... [2020-09-04 21:37:28,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e238783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:37:28, skipping insertion in model container [2020-09-04 21:37:28,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:37:28" (3/3) ... [2020-09-04 21:37:28,582 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2020-09-04 21:37:28,594 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:37:28,604 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:37:28,626 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:37:28,652 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:37:28,652 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:37:28,652 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:37:28,653 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:37:28,653 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:37:28,653 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:37:28,653 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:37:28,653 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:37:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2020-09-04 21:37:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-09-04 21:37:28,692 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:28,693 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:28,693 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:28,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:28,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2062280112, now seen corresponding path program 1 times [2020-09-04 21:37:28,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:28,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2118294796] [2020-09-04 21:37:28,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:28,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:28,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:28,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 21:37:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 21:37:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 21:37:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:29,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2118294796] [2020-09-04 21:37:29,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:29,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-09-04 21:37:29,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513142323] [2020-09-04 21:37:29,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 21:37:29,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:29,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 21:37:29,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 21:37:29,135 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2020-09-04 21:37:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:29,342 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2020-09-04 21:37:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:37:29,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-09-04 21:37:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:29,363 INFO L225 Difference]: With dead ends: 286 [2020-09-04 21:37:29,363 INFO L226 Difference]: Without dead ends: 168 [2020-09-04 21:37:29,369 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-04 21:37:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-09-04 21:37:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 145. [2020-09-04 21:37:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-09-04 21:37:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2020-09-04 21:37:29,469 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 100 [2020-09-04 21:37:29,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:29,470 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2020-09-04 21:37:29,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 21:37:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2020-09-04 21:37:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-04 21:37:29,476 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:29,477 INFO L422 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:29,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:37:29,477 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1947593625, now seen corresponding path program 1 times [2020-09-04 21:37:29,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:29,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [888356145] [2020-09-04 21:37:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 21:37:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 21:37:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 21:37:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:29,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [888356145] [2020-09-04 21:37:29,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:29,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-09-04 21:37:29,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798982801] [2020-09-04 21:37:29,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 21:37:29,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:29,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 21:37:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 21:37:29,657 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand 4 states. [2020-09-04 21:37:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:29,778 INFO L93 Difference]: Finished difference Result 278 states and 331 transitions. [2020-09-04 21:37:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 21:37:29,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-09-04 21:37:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:29,782 INFO L225 Difference]: With dead ends: 278 [2020-09-04 21:37:29,782 INFO L226 Difference]: Without dead ends: 169 [2020-09-04 21:37:29,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-04 21:37:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-09-04 21:37:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2020-09-04 21:37:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-09-04 21:37:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2020-09-04 21:37:29,817 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 103 [2020-09-04 21:37:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:29,820 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2020-09-04 21:37:29,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 21:37:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2020-09-04 21:37:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 21:37:29,829 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:29,829 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:29,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:37:29,830 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:29,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1622356113, now seen corresponding path program 1 times [2020-09-04 21:37:29,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:29,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [695133898] [2020-09-04 21:37:29,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:29,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 21:37:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 21:37:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 21:37:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:30,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [695133898] [2020-09-04 21:37:30,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:30,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-04 21:37:30,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998035559] [2020-09-04 21:37:30,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:37:30,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:30,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:37:30,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:37:30,056 INFO L87 Difference]: Start difference. First operand 157 states and 185 transitions. Second operand 5 states. [2020-09-04 21:37:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:30,160 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2020-09-04 21:37:30,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:37:30,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-04 21:37:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:30,163 INFO L225 Difference]: With dead ends: 314 [2020-09-04 21:37:30,164 INFO L226 Difference]: Without dead ends: 192 [2020-09-04 21:37:30,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-04 21:37:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-09-04 21:37:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 173. [2020-09-04 21:37:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-09-04 21:37:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2020-09-04 21:37:30,189 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 108 [2020-09-04 21:37:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:30,189 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2020-09-04 21:37:30,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:37:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2020-09-04 21:37:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 21:37:30,194 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:30,194 INFO L422 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:30,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:37:30,194 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1409900093, now seen corresponding path program 1 times [2020-09-04 21:37:30,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:30,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2093837211] [2020-09-04 21:37:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 21:37:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 21:37:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 21:37:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:30,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2093837211] [2020-09-04 21:37:30,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:30,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-04 21:37:30,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498239735] [2020-09-04 21:37:30,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:37:30,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:30,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:37:30,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:37:30,368 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 5 states. [2020-09-04 21:37:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:30,494 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2020-09-04 21:37:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:37:30,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-04 21:37:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:30,497 INFO L225 Difference]: With dead ends: 314 [2020-09-04 21:37:30,497 INFO L226 Difference]: Without dead ends: 194 [2020-09-04 21:37:30,498 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-04 21:37:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-09-04 21:37:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2020-09-04 21:37:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-09-04 21:37:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 207 transitions. [2020-09-04 21:37:30,520 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 207 transitions. Word has length 108 [2020-09-04 21:37:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:30,521 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 207 transitions. [2020-09-04 21:37:30,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:37:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 207 transitions. [2020-09-04 21:37:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-04 21:37:30,523 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:30,523 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:30,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:37:30,524 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:30,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2129807001, now seen corresponding path program 2 times [2020-09-04 21:37:30,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:30,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [22316110] [2020-09-04 21:37:30,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 21:37:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 21:37:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 21:37:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:30,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [22316110] [2020-09-04 21:37:30,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:30,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:37:30,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780985501] [2020-09-04 21:37:30,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:37:30,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:30,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:37:30,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:37:30,658 INFO L87 Difference]: Start difference. First operand 176 states and 207 transitions. Second operand 6 states. [2020-09-04 21:37:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:30,760 INFO L93 Difference]: Finished difference Result 348 states and 416 transitions. [2020-09-04 21:37:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:37:30,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-09-04 21:37:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:30,763 INFO L225 Difference]: With dead ends: 348 [2020-09-04 21:37:30,763 INFO L226 Difference]: Without dead ends: 218 [2020-09-04 21:37:30,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-04 21:37:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-09-04 21:37:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 186. [2020-09-04 21:37:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-09-04 21:37:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2020-09-04 21:37:30,786 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 113 [2020-09-04 21:37:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:30,786 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2020-09-04 21:37:30,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:37:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2020-09-04 21:37:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-04 21:37:30,789 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:30,789 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:30,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:37:30,789 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash -902449205, now seen corresponding path program 1 times [2020-09-04 21:37:30,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:30,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [493508537] [2020-09-04 21:37:30,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 21:37:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 21:37:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 21:37:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:30,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [493508537] [2020-09-04 21:37:30,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:30,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:37:30,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941209744] [2020-09-04 21:37:30,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:37:30,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:30,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:37:30,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:37:30,937 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 6 states. [2020-09-04 21:37:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:31,065 INFO L93 Difference]: Finished difference Result 342 states and 410 transitions. [2020-09-04 21:37:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:37:31,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-09-04 21:37:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:31,068 INFO L225 Difference]: With dead ends: 342 [2020-09-04 21:37:31,068 INFO L226 Difference]: Without dead ends: 214 [2020-09-04 21:37:31,069 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-04 21:37:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-09-04 21:37:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 186. [2020-09-04 21:37:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-09-04 21:37:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2020-09-04 21:37:31,087 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 113 [2020-09-04 21:37:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:31,088 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2020-09-04 21:37:31,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:37:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2020-09-04 21:37:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-04 21:37:31,090 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:31,090 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:31,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:37:31,091 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash 139965841, now seen corresponding path program 3 times [2020-09-04 21:37:31,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:31,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [79745014] [2020-09-04 21:37:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 21:37:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 21:37:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 21:37:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:31,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [79745014] [2020-09-04 21:37:31,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:31,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:37:31,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992946541] [2020-09-04 21:37:31,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:37:31,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:37:31,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:37:31,223 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 7 states. [2020-09-04 21:37:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:31,343 INFO L93 Difference]: Finished difference Result 375 states and 449 transitions. [2020-09-04 21:37:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:37:31,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2020-09-04 21:37:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:31,346 INFO L225 Difference]: With dead ends: 375 [2020-09-04 21:37:31,346 INFO L226 Difference]: Without dead ends: 240 [2020-09-04 21:37:31,347 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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-04 21:37:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-09-04 21:37:31,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 196. [2020-09-04 21:37:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-09-04 21:37:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2020-09-04 21:37:31,369 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 118 [2020-09-04 21:37:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:31,370 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-09-04 21:37:31,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:37:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2020-09-04 21:37:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-04 21:37:31,372 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:31,372 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:31,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:37:31,373 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:31,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:31,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1402676931, now seen corresponding path program 2 times [2020-09-04 21:37:31,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:31,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1213004622] [2020-09-04 21:37:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 21:37:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 21:37:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 21:37:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:31,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1213004622] [2020-09-04 21:37:31,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:31,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:37:31,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524343953] [2020-09-04 21:37:31,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:37:31,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:31,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:37:31,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:37:31,563 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 7 states. [2020-09-04 21:37:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:31,712 INFO L93 Difference]: Finished difference Result 361 states and 435 transitions. [2020-09-04 21:37:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:37:31,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2020-09-04 21:37:31,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:31,715 INFO L225 Difference]: With dead ends: 361 [2020-09-04 21:37:31,715 INFO L226 Difference]: Without dead ends: 228 [2020-09-04 21:37:31,716 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-04 21:37:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-09-04 21:37:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 196. [2020-09-04 21:37:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-09-04 21:37:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2020-09-04 21:37:31,736 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 118 [2020-09-04 21:37:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:31,736 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-09-04 21:37:31,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:37:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2020-09-04 21:37:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:37:31,738 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:31,738 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:31,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:37:31,739 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:31,739 INFO L82 PathProgramCache]: Analyzing trace with hash -229056103, now seen corresponding path program 4 times [2020-09-04 21:37:31,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:31,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1952835028] [2020-09-04 21:37:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 21:37:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 21:37:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-04 21:37:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:31,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1952835028] [2020-09-04 21:37:31,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:31,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:37:31,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195975056] [2020-09-04 21:37:31,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:37:31,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:31,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:37:31,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:37:31,883 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 8 states. [2020-09-04 21:37:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:32,021 INFO L93 Difference]: Finished difference Result 402 states and 482 transitions. [2020-09-04 21:37:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:37:32,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-09-04 21:37:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:32,024 INFO L225 Difference]: With dead ends: 402 [2020-09-04 21:37:32,024 INFO L226 Difference]: Without dead ends: 262 [2020-09-04 21:37:32,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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-04 21:37:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-09-04 21:37:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 206. [2020-09-04 21:37:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-09-04 21:37:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2020-09-04 21:37:32,047 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 123 [2020-09-04 21:37:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:32,048 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2020-09-04 21:37:32,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:37:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2020-09-04 21:37:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:37:32,050 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:32,050 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:32,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:37:32,051 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:32,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:32,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1033654987, now seen corresponding path program 3 times [2020-09-04 21:37:32,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:32,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706464125] [2020-09-04 21:37:32,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 21:37:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 21:37:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-04 21:37:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:32,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706464125] [2020-09-04 21:37:32,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:32,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:37:32,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794042202] [2020-09-04 21:37:32,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:37:32,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:32,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:37:32,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:37:32,242 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand 8 states. [2020-09-04 21:37:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:32,427 INFO L93 Difference]: Finished difference Result 380 states and 460 transitions. [2020-09-04 21:37:32,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:37:32,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-09-04 21:37:32,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:32,429 INFO L225 Difference]: With dead ends: 380 [2020-09-04 21:37:32,430 INFO L226 Difference]: Without dead ends: 242 [2020-09-04 21:37:32,431 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-04 21:37:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-09-04 21:37:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 206. [2020-09-04 21:37:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-09-04 21:37:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2020-09-04 21:37:32,453 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 123 [2020-09-04 21:37:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:32,454 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2020-09-04 21:37:32,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:37:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2020-09-04 21:37:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 21:37:32,456 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:32,456 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:32,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:37:32,456 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1138358929, now seen corresponding path program 5 times [2020-09-04 21:37:32,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:32,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [300605178] [2020-09-04 21:37:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 21:37:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 21:37:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 21:37:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:32,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [300605178] [2020-09-04 21:37:32,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:32,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:37:32,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47227085] [2020-09-04 21:37:32,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:37:32,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:32,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:37:32,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:37:32,611 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand 9 states. [2020-09-04 21:37:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:32,780 INFO L93 Difference]: Finished difference Result 429 states and 515 transitions. [2020-09-04 21:37:32,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:37:32,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-09-04 21:37:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:32,783 INFO L225 Difference]: With dead ends: 429 [2020-09-04 21:37:32,783 INFO L226 Difference]: Without dead ends: 284 [2020-09-04 21:37:32,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 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-04 21:37:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-09-04 21:37:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 216. [2020-09-04 21:37:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-09-04 21:37:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2020-09-04 21:37:32,810 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 128 [2020-09-04 21:37:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:32,811 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2020-09-04 21:37:32,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:37:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2020-09-04 21:37:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 21:37:32,813 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:32,813 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:32,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:37:32,814 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:32,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:32,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1893897277, now seen corresponding path program 4 times [2020-09-04 21:37:32,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:32,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1060669100] [2020-09-04 21:37:32,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 21:37:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 21:37:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:32,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 21:37:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:33,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1060669100] [2020-09-04 21:37:33,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:33,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:37:33,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257763455] [2020-09-04 21:37:33,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:37:33,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:33,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:37:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:37:33,047 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand 9 states. [2020-09-04 21:37:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:33,253 INFO L93 Difference]: Finished difference Result 399 states and 485 transitions. [2020-09-04 21:37:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:37:33,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-09-04 21:37:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:33,257 INFO L225 Difference]: With dead ends: 399 [2020-09-04 21:37:33,257 INFO L226 Difference]: Without dead ends: 256 [2020-09-04 21:37:33,258 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-04 21:37:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-09-04 21:37:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 216. [2020-09-04 21:37:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-09-04 21:37:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2020-09-04 21:37:33,286 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 128 [2020-09-04 21:37:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:33,287 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2020-09-04 21:37:33,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:37:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2020-09-04 21:37:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-04 21:37:33,290 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:33,291 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:33,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:37:33,291 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1450818713, now seen corresponding path program 6 times [2020-09-04 21:37:33,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:33,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1133100037] [2020-09-04 21:37:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:37:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 21:37:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 21:37:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 99 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:33,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1133100037] [2020-09-04 21:37:33,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:33,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:37:33,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972662117] [2020-09-04 21:37:33,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:37:33,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:37:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:37:33,473 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand 10 states. [2020-09-04 21:37:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:33,647 INFO L93 Difference]: Finished difference Result 456 states and 548 transitions. [2020-09-04 21:37:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:37:33,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-09-04 21:37:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:33,650 INFO L225 Difference]: With dead ends: 456 [2020-09-04 21:37:33,650 INFO L226 Difference]: Without dead ends: 306 [2020-09-04 21:37:33,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:37:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-09-04 21:37:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 226. [2020-09-04 21:37:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-09-04 21:37:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 272 transitions. [2020-09-04 21:37:33,678 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 272 transitions. Word has length 133 [2020-09-04 21:37:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:33,679 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 272 transitions. [2020-09-04 21:37:33,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:37:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 272 transitions. [2020-09-04 21:37:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-04 21:37:33,681 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:33,681 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:33,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:37:33,682 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:33,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:33,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1581437493, now seen corresponding path program 5 times [2020-09-04 21:37:33,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:33,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [237771882] [2020-09-04 21:37:33,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:37:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 21:37:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 21:37:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 7 proven. 89 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:33,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [237771882] [2020-09-04 21:37:33,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:33,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:37:33,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801036869] [2020-09-04 21:37:33,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:37:33,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:33,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:37:33,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:37:33,934 INFO L87 Difference]: Start difference. First operand 226 states and 272 transitions. Second operand 10 states. [2020-09-04 21:37:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:34,140 INFO L93 Difference]: Finished difference Result 418 states and 510 transitions. [2020-09-04 21:37:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:37:34,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-09-04 21:37:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:34,143 INFO L225 Difference]: With dead ends: 418 [2020-09-04 21:37:34,143 INFO L226 Difference]: Without dead ends: 270 [2020-09-04 21:37:34,144 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-04 21:37:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-09-04 21:37:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 226. [2020-09-04 21:37:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-09-04 21:37:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 272 transitions. [2020-09-04 21:37:34,167 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 272 transitions. Word has length 133 [2020-09-04 21:37:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:34,168 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 272 transitions. [2020-09-04 21:37:34,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:37:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 272 transitions. [2020-09-04 21:37:34,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-09-04 21:37:34,170 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:34,170 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:34,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:37:34,171 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:34,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:34,171 INFO L82 PathProgramCache]: Analyzing trace with hash 688521105, now seen corresponding path program 7 times [2020-09-04 21:37:34,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:34,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [276181938] [2020-09-04 21:37:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 21:37:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 21:37:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 21:37:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 131 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:34,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [276181938] [2020-09-04 21:37:34,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:34,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:37:34,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374837207] [2020-09-04 21:37:34,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:37:34,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:34,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:37:34,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:37:34,373 INFO L87 Difference]: Start difference. First operand 226 states and 272 transitions. Second operand 11 states. [2020-09-04 21:37:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:34,569 INFO L93 Difference]: Finished difference Result 483 states and 581 transitions. [2020-09-04 21:37:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:37:34,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2020-09-04 21:37:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:34,574 INFO L225 Difference]: With dead ends: 483 [2020-09-04 21:37:34,574 INFO L226 Difference]: Without dead ends: 328 [2020-09-04 21:37:34,578 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 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-04 21:37:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-09-04 21:37:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 236. [2020-09-04 21:37:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-04 21:37:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2020-09-04 21:37:34,617 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 138 [2020-09-04 21:37:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:34,618 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2020-09-04 21:37:34,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:37:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2020-09-04 21:37:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-09-04 21:37:34,620 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:34,620 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:34,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:37:34,621 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:34,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1951232195, now seen corresponding path program 6 times [2020-09-04 21:37:34,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:34,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999011182] [2020-09-04 21:37:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 21:37:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:34,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 21:37:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 21:37:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:35,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1999011182] [2020-09-04 21:37:35,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:35,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:37:35,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237678871] [2020-09-04 21:37:35,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:37:35,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:35,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:37:35,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:37:35,061 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 11 states. [2020-09-04 21:37:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:35,444 INFO L93 Difference]: Finished difference Result 437 states and 535 transitions. [2020-09-04 21:37:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:37:35,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2020-09-04 21:37:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:35,448 INFO L225 Difference]: With dead ends: 437 [2020-09-04 21:37:35,448 INFO L226 Difference]: Without dead ends: 284 [2020-09-04 21:37:35,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:37:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-09-04 21:37:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2020-09-04 21:37:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-04 21:37:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2020-09-04 21:37:35,491 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 138 [2020-09-04 21:37:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:35,492 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2020-09-04 21:37:35,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:37:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2020-09-04 21:37:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-04 21:37:35,496 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:35,497 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:35,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:37:35,497 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1216030823, now seen corresponding path program 8 times [2020-09-04 21:37:35,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:35,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [114673362] [2020-09-04 21:37:35,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 21:37:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-04 21:37:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 21:37:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:35,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [114673362] [2020-09-04 21:37:35,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:35,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:37:35,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104642535] [2020-09-04 21:37:35,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:37:35,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:37:35,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:37:35,742 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 12 states. [2020-09-04 21:37:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:35,972 INFO L93 Difference]: Finished difference Result 510 states and 614 transitions. [2020-09-04 21:37:35,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:37:35,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2020-09-04 21:37:35,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:35,978 INFO L225 Difference]: With dead ends: 510 [2020-09-04 21:37:35,978 INFO L226 Difference]: Without dead ends: 350 [2020-09-04 21:37:35,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 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-04 21:37:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-09-04 21:37:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 246. [2020-09-04 21:37:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-09-04 21:37:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 298 transitions. [2020-09-04 21:37:36,023 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 298 transitions. Word has length 143 [2020-09-04 21:37:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:36,023 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 298 transitions. [2020-09-04 21:37:36,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:37:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 298 transitions. [2020-09-04 21:37:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-04 21:37:36,026 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:36,026 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:36,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 21:37:36,027 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:36,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash 46680267, now seen corresponding path program 7 times [2020-09-04 21:37:36,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:36,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [392081016] [2020-09-04 21:37:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 21:37:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-04 21:37:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 21:37:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 7 proven. 154 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:36,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [392081016] [2020-09-04 21:37:36,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:36,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:37:36,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232236170] [2020-09-04 21:37:36,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:37:36,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:36,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:37:36,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:37:36,307 INFO L87 Difference]: Start difference. First operand 246 states and 298 transitions. Second operand 12 states. [2020-09-04 21:37:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:36,599 INFO L93 Difference]: Finished difference Result 456 states and 560 transitions. [2020-09-04 21:37:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:37:36,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2020-09-04 21:37:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:36,602 INFO L225 Difference]: With dead ends: 456 [2020-09-04 21:37:36,603 INFO L226 Difference]: Without dead ends: 298 [2020-09-04 21:37:36,604 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-04 21:37:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-09-04 21:37:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 246. [2020-09-04 21:37:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-09-04 21:37:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 298 transitions. [2020-09-04 21:37:36,629 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 298 transitions. Word has length 143 [2020-09-04 21:37:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:36,630 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 298 transitions. [2020-09-04 21:37:36,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:37:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 298 transitions. [2020-09-04 21:37:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-09-04 21:37:36,632 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:36,632 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:36,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 21:37:36,633 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:36,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:36,633 INFO L82 PathProgramCache]: Analyzing trace with hash -910703471, now seen corresponding path program 9 times [2020-09-04 21:37:36,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:36,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [548244597] [2020-09-04 21:37:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-09-04 21:37:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-09-04 21:37:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-04 21:37:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:36,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [548244597] [2020-09-04 21:37:36,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:36,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:37:36,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830411870] [2020-09-04 21:37:36,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:37:36,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:37:36,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:37:36,869 INFO L87 Difference]: Start difference. First operand 246 states and 298 transitions. Second operand 13 states. [2020-09-04 21:37:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:37,115 INFO L93 Difference]: Finished difference Result 537 states and 647 transitions. [2020-09-04 21:37:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:37:37,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2020-09-04 21:37:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:37,120 INFO L225 Difference]: With dead ends: 537 [2020-09-04 21:37:37,120 INFO L226 Difference]: Without dead ends: 372 [2020-09-04 21:37:37,122 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 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-04 21:37:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-09-04 21:37:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 256. [2020-09-04 21:37:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-09-04 21:37:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 311 transitions. [2020-09-04 21:37:37,155 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 311 transitions. Word has length 148 [2020-09-04 21:37:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:37,155 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 311 transitions. [2020-09-04 21:37:37,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:37:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 311 transitions. [2020-09-04 21:37:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-09-04 21:37:37,158 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:37,158 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:37,158 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 21:37:37,158 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:37,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:37,159 INFO L82 PathProgramCache]: Analyzing trace with hash 352007619, now seen corresponding path program 8 times [2020-09-04 21:37:37,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:37,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [565143700] [2020-09-04 21:37:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-09-04 21:37:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-09-04 21:37:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-04 21:37:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 7 proven. 194 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:37,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [565143700] [2020-09-04 21:37:37,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:37,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:37:37,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169578063] [2020-09-04 21:37:37,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:37:37,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:37:37,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:37:37,463 INFO L87 Difference]: Start difference. First operand 256 states and 311 transitions. Second operand 13 states. [2020-09-04 21:37:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:37,874 INFO L93 Difference]: Finished difference Result 475 states and 585 transitions. [2020-09-04 21:37:37,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:37:37,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2020-09-04 21:37:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:37,878 INFO L225 Difference]: With dead ends: 475 [2020-09-04 21:37:37,878 INFO L226 Difference]: Without dead ends: 312 [2020-09-04 21:37:37,879 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-04 21:37:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-09-04 21:37:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 256. [2020-09-04 21:37:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-09-04 21:37:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 311 transitions. [2020-09-04 21:37:37,926 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 311 transitions. Word has length 148 [2020-09-04 21:37:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:37,927 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 311 transitions. [2020-09-04 21:37:37,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:37:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 311 transitions. [2020-09-04 21:37:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 21:37:37,929 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:37,930 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:37,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 21:37:37,930 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1515572583, now seen corresponding path program 10 times [2020-09-04 21:37:37,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:37,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1048719301] [2020-09-04 21:37:37,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:37,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 21:37:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 21:37:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 21:37:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 6 proven. 257 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:38,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1048719301] [2020-09-04 21:37:38,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:38,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:37:38,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883354682] [2020-09-04 21:37:38,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:37:38,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:37:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:37:38,248 INFO L87 Difference]: Start difference. First operand 256 states and 311 transitions. Second operand 14 states. [2020-09-04 21:37:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:38,449 INFO L93 Difference]: Finished difference Result 564 states and 680 transitions. [2020-09-04 21:37:38,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:37:38,450 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2020-09-04 21:37:38,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:38,453 INFO L225 Difference]: With dead ends: 564 [2020-09-04 21:37:38,453 INFO L226 Difference]: Without dead ends: 394 [2020-09-04 21:37:38,454 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 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-04 21:37:38,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-09-04 21:37:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 266. [2020-09-04 21:37:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-09-04 21:37:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2020-09-04 21:37:38,485 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 153 [2020-09-04 21:37:38,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:38,485 INFO L479 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2020-09-04 21:37:38,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:37:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2020-09-04 21:37:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 21:37:38,488 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:38,488 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:38,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 21:37:38,490 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:38,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:38,490 INFO L82 PathProgramCache]: Analyzing trace with hash -252861493, now seen corresponding path program 9 times [2020-09-04 21:37:38,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:38,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [71858194] [2020-09-04 21:37:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 21:37:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 21:37:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 21:37:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 7 proven. 239 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:38,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [71858194] [2020-09-04 21:37:38,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:38,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:37:38,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134112765] [2020-09-04 21:37:38,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:37:38,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:38,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:37:38,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:37:38,855 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand 14 states. [2020-09-04 21:37:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:39,263 INFO L93 Difference]: Finished difference Result 494 states and 610 transitions. [2020-09-04 21:37:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:37:39,265 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2020-09-04 21:37:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:39,267 INFO L225 Difference]: With dead ends: 494 [2020-09-04 21:37:39,267 INFO L226 Difference]: Without dead ends: 326 [2020-09-04 21:37:39,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:37:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-09-04 21:37:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2020-09-04 21:37:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-09-04 21:37:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2020-09-04 21:37:39,300 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 153 [2020-09-04 21:37:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:39,301 INFO L479 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2020-09-04 21:37:39,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:37:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2020-09-04 21:37:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-04 21:37:39,303 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:39,304 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:39,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 21:37:39,304 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:39,305 INFO L82 PathProgramCache]: Analyzing trace with hash 867387793, now seen corresponding path program 11 times [2020-09-04 21:37:39,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:39,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [818952998] [2020-09-04 21:37:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 21:37:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 21:37:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 21:37:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 6 proven. 309 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:39,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [818952998] [2020-09-04 21:37:39,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:39,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:37:39,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956956898] [2020-09-04 21:37:39,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:37:39,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:39,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:37:39,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:37:39,665 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand 15 states. [2020-09-04 21:37:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:40,034 INFO L93 Difference]: Finished difference Result 591 states and 713 transitions. [2020-09-04 21:37:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:37:40,034 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2020-09-04 21:37:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:40,037 INFO L225 Difference]: With dead ends: 591 [2020-09-04 21:37:40,038 INFO L226 Difference]: Without dead ends: 416 [2020-09-04 21:37:40,039 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 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-04 21:37:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-09-04 21:37:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 276. [2020-09-04 21:37:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-09-04 21:37:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2020-09-04 21:37:40,085 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 158 [2020-09-04 21:37:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:40,086 INFO L479 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2020-09-04 21:37:40,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:37:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2020-09-04 21:37:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-04 21:37:40,088 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:40,088 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:40,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 21:37:40,089 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:40,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2130098883, now seen corresponding path program 10 times [2020-09-04 21:37:40,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:40,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538577922] [2020-09-04 21:37:40,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 21:37:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 21:37:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 21:37:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 7 proven. 289 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:40,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538577922] [2020-09-04 21:37:40,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:40,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:37:40,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115010110] [2020-09-04 21:37:40,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:37:40,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:37:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:37:40,470 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand 15 states. [2020-09-04 21:37:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:40,966 INFO L93 Difference]: Finished difference Result 513 states and 635 transitions. [2020-09-04 21:37:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:37:40,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2020-09-04 21:37:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:40,969 INFO L225 Difference]: With dead ends: 513 [2020-09-04 21:37:40,969 INFO L226 Difference]: Without dead ends: 340 [2020-09-04 21:37:40,970 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-04 21:37:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-09-04 21:37:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 276. [2020-09-04 21:37:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-09-04 21:37:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2020-09-04 21:37:40,998 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 158 [2020-09-04 21:37:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:40,998 INFO L479 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2020-09-04 21:37:40,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:37:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2020-09-04 21:37:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-04 21:37:41,001 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:41,001 INFO L422 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:41,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 21:37:41,002 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:41,002 INFO L82 PathProgramCache]: Analyzing trace with hash 890883481, now seen corresponding path program 12 times [2020-09-04 21:37:41,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:41,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [757563749] [2020-09-04 21:37:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 21:37:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 21:37:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 21:37:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 366 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:41,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [757563749] [2020-09-04 21:37:41,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:41,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:37:41,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830668585] [2020-09-04 21:37:41,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:37:41,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:41,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:37:41,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:37:41,296 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand 16 states. [2020-09-04 21:37:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:41,556 INFO L93 Difference]: Finished difference Result 618 states and 746 transitions. [2020-09-04 21:37:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:37:41,557 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 163 [2020-09-04 21:37:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:41,560 INFO L225 Difference]: With dead ends: 618 [2020-09-04 21:37:41,560 INFO L226 Difference]: Without dead ends: 438 [2020-09-04 21:37:41,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:37:41,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-09-04 21:37:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 286. [2020-09-04 21:37:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-09-04 21:37:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 350 transitions. [2020-09-04 21:37:41,592 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 350 transitions. Word has length 163 [2020-09-04 21:37:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:41,592 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 350 transitions. [2020-09-04 21:37:41,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:37:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 350 transitions. [2020-09-04 21:37:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-04 21:37:41,595 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:41,595 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:41,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 21:37:41,595 INFO L427 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:41,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372725, now seen corresponding path program 11 times [2020-09-04 21:37:41,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:41,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [495145033] [2020-09-04 21:37:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 21:37:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 21:37:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:41,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 21:37:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 7 proven. 344 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:42,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [495145033] [2020-09-04 21:37:42,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:42,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:37:42,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319283955] [2020-09-04 21:37:42,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:37:42,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:42,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:37:42,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:37:42,039 INFO L87 Difference]: Start difference. First operand 286 states and 350 transitions. Second operand 16 states. [2020-09-04 21:37:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:42,571 INFO L93 Difference]: Finished difference Result 532 states and 660 transitions. [2020-09-04 21:37:42,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:37:42,571 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 163 [2020-09-04 21:37:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:42,574 INFO L225 Difference]: With dead ends: 532 [2020-09-04 21:37:42,574 INFO L226 Difference]: Without dead ends: 354 [2020-09-04 21:37:42,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:37:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-09-04 21:37:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 286. [2020-09-04 21:37:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-09-04 21:37:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 350 transitions. [2020-09-04 21:37:42,608 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 350 transitions. Word has length 163 [2020-09-04 21:37:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:42,609 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 350 transitions. [2020-09-04 21:37:42,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:37:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 350 transitions. [2020-09-04 21:37:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 21:37:42,612 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:42,612 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:42,612 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 21:37:42,613 INFO L427 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:42,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:42,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1892454033, now seen corresponding path program 13 times [2020-09-04 21:37:42,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:42,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [136873932] [2020-09-04 21:37:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 21:37:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 21:37:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 21:37:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 6 proven. 428 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:42,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [136873932] [2020-09-04 21:37:42,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:42,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:37:42,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136733236] [2020-09-04 21:37:42,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:37:42,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:42,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:37:42,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:37:42,967 INFO L87 Difference]: Start difference. First operand 286 states and 350 transitions. Second operand 17 states. [2020-09-04 21:37:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:43,303 INFO L93 Difference]: Finished difference Result 645 states and 779 transitions. [2020-09-04 21:37:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:37:43,304 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2020-09-04 21:37:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:43,307 INFO L225 Difference]: With dead ends: 645 [2020-09-04 21:37:43,307 INFO L226 Difference]: Without dead ends: 460 [2020-09-04 21:37:43,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:37:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-09-04 21:37:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 296. [2020-09-04 21:37:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-04 21:37:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2020-09-04 21:37:43,346 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 168 [2020-09-04 21:37:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:43,347 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2020-09-04 21:37:43,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:37:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2020-09-04 21:37:43,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 21:37:43,350 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:43,350 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:43,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-04 21:37:43,351 INFO L427 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:43,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:43,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1139802173, now seen corresponding path program 12 times [2020-09-04 21:37:43,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:43,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883120156] [2020-09-04 21:37:43,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 21:37:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 21:37:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 21:37:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 7 proven. 404 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:43,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883120156] [2020-09-04 21:37:43,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:43,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:37:43,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287850552] [2020-09-04 21:37:43,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:37:43,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:43,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:37:43,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:37:43,794 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 17 states. [2020-09-04 21:37:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:44,432 INFO L93 Difference]: Finished difference Result 551 states and 685 transitions. [2020-09-04 21:37:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:37:44,432 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2020-09-04 21:37:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:44,435 INFO L225 Difference]: With dead ends: 551 [2020-09-04 21:37:44,435 INFO L226 Difference]: Without dead ends: 368 [2020-09-04 21:37:44,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:37:44,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2020-09-04 21:37:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 296. [2020-09-04 21:37:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-04 21:37:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2020-09-04 21:37:44,468 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 168 [2020-09-04 21:37:44,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:44,468 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2020-09-04 21:37:44,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:37:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2020-09-04 21:37:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-09-04 21:37:44,471 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:44,471 INFO L422 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:44,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-04 21:37:44,472 INFO L427 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:44,472 INFO L82 PathProgramCache]: Analyzing trace with hash -33314663, now seen corresponding path program 14 times [2020-09-04 21:37:44,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:44,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1293909312] [2020-09-04 21:37:44,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-09-04 21:37:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 21:37:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-09-04 21:37:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 6 proven. 495 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:44,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1293909312] [2020-09-04 21:37:44,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:44,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 21:37:44,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392918137] [2020-09-04 21:37:44,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 21:37:44,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 21:37:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:37:44,840 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 18 states. [2020-09-04 21:37:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:45,199 INFO L93 Difference]: Finished difference Result 672 states and 812 transitions. [2020-09-04 21:37:45,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:37:45,200 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2020-09-04 21:37:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:45,203 INFO L225 Difference]: With dead ends: 672 [2020-09-04 21:37:45,203 INFO L226 Difference]: Without dead ends: 482 [2020-09-04 21:37:45,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 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-04 21:37:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-09-04 21:37:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 306. [2020-09-04 21:37:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-09-04 21:37:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 376 transitions. [2020-09-04 21:37:45,242 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 376 transitions. Word has length 173 [2020-09-04 21:37:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:45,242 INFO L479 AbstractCegarLoop]: Abstraction has 306 states and 376 transitions. [2020-09-04 21:37:45,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 21:37:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 376 transitions. [2020-09-04 21:37:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-09-04 21:37:45,245 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:45,245 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:45,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-04 21:37:45,245 INFO L427 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1229396427, now seen corresponding path program 13 times [2020-09-04 21:37:45,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:45,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1235462506] [2020-09-04 21:37:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-09-04 21:37:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 21:37:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-09-04 21:37:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 7 proven. 469 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:45,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1235462506] [2020-09-04 21:37:45,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:45,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 21:37:45,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946544332] [2020-09-04 21:37:45,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 21:37:45,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 21:37:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:37:45,782 INFO L87 Difference]: Start difference. First operand 306 states and 376 transitions. Second operand 18 states. [2020-09-04 21:37:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:46,395 INFO L93 Difference]: Finished difference Result 570 states and 710 transitions. [2020-09-04 21:37:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:37:46,395 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2020-09-04 21:37:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:46,398 INFO L225 Difference]: With dead ends: 570 [2020-09-04 21:37:46,398 INFO L226 Difference]: Without dead ends: 382 [2020-09-04 21:37:46,399 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-04 21:37:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-09-04 21:37:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 306. [2020-09-04 21:37:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-09-04 21:37:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 376 transitions. [2020-09-04 21:37:46,430 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 376 transitions. Word has length 173 [2020-09-04 21:37:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:46,431 INFO L479 AbstractCegarLoop]: Abstraction has 306 states and 376 transitions. [2020-09-04 21:37:46,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 21:37:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 376 transitions. [2020-09-04 21:37:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-09-04 21:37:46,434 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:46,434 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:46,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-04 21:37:46,434 INFO L427 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:46,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2032954479, now seen corresponding path program 15 times [2020-09-04 21:37:46,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:46,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [619894285] [2020-09-04 21:37:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 21:37:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 21:37:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-09-04 21:37:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2020-09-04 21:37:46,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [619894285] [2020-09-04 21:37:46,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:37:46,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 21:37:46,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929709510] [2020-09-04 21:37:46,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 21:37:46,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 21:37:46,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 21:37:46,554 INFO L87 Difference]: Start difference. First operand 306 states and 376 transitions. Second operand 3 states. [2020-09-04 21:37:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:46,583 INFO L93 Difference]: Finished difference Result 321 states and 393 transitions. [2020-09-04 21:37:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 21:37:46,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-09-04 21:37:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:46,585 INFO L225 Difference]: With dead ends: 321 [2020-09-04 21:37:46,585 INFO L226 Difference]: Without dead ends: 305 [2020-09-04 21:37:46,586 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-04 21:37:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-09-04 21:37:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2020-09-04 21:37:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-09-04 21:37:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 374 transitions. [2020-09-04 21:37:46,621 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 374 transitions. Word has length 178 [2020-09-04 21:37:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:46,622 INFO L479 AbstractCegarLoop]: Abstraction has 305 states and 374 transitions. [2020-09-04 21:37:46,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 21:37:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2020-09-04 21:37:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 21:37:46,623 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:46,623 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:46,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-04 21:37:46,624 INFO L427 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:46,624 INFO L82 PathProgramCache]: Analyzing trace with hash 368593816, now seen corresponding path program 1 times [2020-09-04 21:37:46,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:46,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [507113651] [2020-09-04 21:37:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 21:37:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 21:37:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 21:37:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2020-09-04 21:37:46,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [507113651] [2020-09-04 21:37:46,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:37:46,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 21:37:46,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551199758] [2020-09-04 21:37:46,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 21:37:46,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:46,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 21:37:46,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 21:37:46,728 INFO L87 Difference]: Start difference. First operand 305 states and 374 transitions. Second operand 4 states. [2020-09-04 21:37:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:46,768 INFO L93 Difference]: Finished difference Result 321 states and 392 transitions. [2020-09-04 21:37:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 21:37:46,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2020-09-04 21:37:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:46,771 INFO L225 Difference]: With dead ends: 321 [2020-09-04 21:37:46,771 INFO L226 Difference]: Without dead ends: 304 [2020-09-04 21:37:46,771 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-04 21:37:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-09-04 21:37:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-09-04 21:37:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-09-04 21:37:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 372 transitions. [2020-09-04 21:37:46,801 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 372 transitions. Word has length 180 [2020-09-04 21:37:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:46,802 INFO L479 AbstractCegarLoop]: Abstraction has 304 states and 372 transitions. [2020-09-04 21:37:46,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 21:37:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 372 transitions. [2020-09-04 21:37:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 21:37:46,804 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:46,804 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:46,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-09-04 21:37:46,804 INFO L427 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:46,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:46,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1683689272, now seen corresponding path program 1 times [2020-09-04 21:37:46,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:46,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [502278790] [2020-09-04 21:37:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 21:37:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 21:37:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 21:37:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 6 proven. 567 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:47,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [502278790] [2020-09-04 21:37:47,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:47,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:37:47,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679541249] [2020-09-04 21:37:47,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:37:47,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:47,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:37:47,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:37:47,226 INFO L87 Difference]: Start difference. First operand 304 states and 372 transitions. Second operand 19 states. [2020-09-04 21:37:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:47,610 INFO L93 Difference]: Finished difference Result 695 states and 837 transitions. [2020-09-04 21:37:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 21:37:47,610 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2020-09-04 21:37:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:47,615 INFO L225 Difference]: With dead ends: 695 [2020-09-04 21:37:47,615 INFO L226 Difference]: Without dead ends: 502 [2020-09-04 21:37:47,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 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-04 21:37:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-09-04 21:37:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 314. [2020-09-04 21:37:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-09-04 21:37:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2020-09-04 21:37:47,689 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 180 [2020-09-04 21:37:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:47,690 INFO L479 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2020-09-04 21:37:47,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:37:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2020-09-04 21:37:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 21:37:47,692 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:47,692 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:47,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-09-04 21:37:47,692 INFO L427 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:47,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:47,692 INFO L82 PathProgramCache]: Analyzing trace with hash -326698006, now seen corresponding path program 1 times [2020-09-04 21:37:47,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:47,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045732969] [2020-09-04 21:37:47,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 21:37:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 21:37:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 21:37:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 7 proven. 539 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:48,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1045732969] [2020-09-04 21:37:48,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:48,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:37:48,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072513091] [2020-09-04 21:37:48,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:37:48,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:48,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:37:48,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:37:48,244 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 19 states. [2020-09-04 21:37:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:48,984 INFO L93 Difference]: Finished difference Result 585 states and 727 transitions. [2020-09-04 21:37:48,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 21:37:48,984 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2020-09-04 21:37:48,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:48,986 INFO L225 Difference]: With dead ends: 585 [2020-09-04 21:37:48,987 INFO L226 Difference]: Without dead ends: 394 [2020-09-04 21:37:48,988 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-04 21:37:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-09-04 21:37:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 314. [2020-09-04 21:37:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-09-04 21:37:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2020-09-04 21:37:49,023 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 180 [2020-09-04 21:37:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:49,024 INFO L479 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2020-09-04 21:37:49,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:37:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2020-09-04 21:37:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-09-04 21:37:49,025 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:49,026 INFO L422 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:49,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-09-04 21:37:49,026 INFO L427 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:49,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:49,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1714201280, now seen corresponding path program 2 times [2020-09-04 21:37:49,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:49,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2094139645] [2020-09-04 21:37:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 21:37:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2020-09-04 21:37:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 21:37:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 6 proven. 644 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:49,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2094139645] [2020-09-04 21:37:49,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:49,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:37:49,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680032758] [2020-09-04 21:37:49,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:37:49,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:49,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:37:49,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:37:49,476 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 20 states. [2020-09-04 21:37:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:49,875 INFO L93 Difference]: Finished difference Result 722 states and 870 transitions. [2020-09-04 21:37:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:37:49,876 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 185 [2020-09-04 21:37:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:49,879 INFO L225 Difference]: With dead ends: 722 [2020-09-04 21:37:49,879 INFO L226 Difference]: Without dead ends: 524 [2020-09-04 21:37:49,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 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-04 21:37:49,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-09-04 21:37:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 324. [2020-09-04 21:37:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-09-04 21:37:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 398 transitions. [2020-09-04 21:37:49,916 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 398 transitions. Word has length 185 [2020-09-04 21:37:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:49,916 INFO L479 AbstractCegarLoop]: Abstraction has 324 states and 398 transitions. [2020-09-04 21:37:49,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:37:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 398 transitions. [2020-09-04 21:37:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-09-04 21:37:49,918 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:49,919 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:49,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-09-04 21:37:49,919 INFO L427 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:49,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash 570378738, now seen corresponding path program 2 times [2020-09-04 21:37:49,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:49,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [31588379] [2020-09-04 21:37:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:49,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 21:37:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2020-09-04 21:37:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 21:37:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 7 proven. 614 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:50,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [31588379] [2020-09-04 21:37:50,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:50,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:37:50,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53514479] [2020-09-04 21:37:50,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:37:50,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:50,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:37:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:37:50,685 INFO L87 Difference]: Start difference. First operand 324 states and 398 transitions. Second operand 20 states. [2020-09-04 21:37:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:51,647 INFO L93 Difference]: Finished difference Result 604 states and 752 transitions. [2020-09-04 21:37:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:37:51,648 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 185 [2020-09-04 21:37:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:51,650 INFO L225 Difference]: With dead ends: 604 [2020-09-04 21:37:51,650 INFO L226 Difference]: Without dead ends: 408 [2020-09-04 21:37:51,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:37:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2020-09-04 21:37:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 324. [2020-09-04 21:37:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-09-04 21:37:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 398 transitions. [2020-09-04 21:37:51,689 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 398 transitions. Word has length 185 [2020-09-04 21:37:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:51,689 INFO L479 AbstractCegarLoop]: Abstraction has 324 states and 398 transitions. [2020-09-04 21:37:51,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:37:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 398 transitions. [2020-09-04 21:37:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-09-04 21:37:51,691 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:51,692 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:51,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-09-04 21:37:51,692 INFO L427 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash 922915896, now seen corresponding path program 3 times [2020-09-04 21:37:51,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:51,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [534130365] [2020-09-04 21:37:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:51,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:51,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:51,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-09-04 21:37:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-04 21:37:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-04 21:37:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 6 proven. 726 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:52,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [534130365] [2020-09-04 21:37:52,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:52,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 21:37:52,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306906088] [2020-09-04 21:37:52,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 21:37:52,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:52,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 21:37:52,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:37:52,207 INFO L87 Difference]: Start difference. First operand 324 states and 398 transitions. Second operand 21 states. [2020-09-04 21:37:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:52,696 INFO L93 Difference]: Finished difference Result 749 states and 903 transitions. [2020-09-04 21:37:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:37:52,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 190 [2020-09-04 21:37:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:52,703 INFO L225 Difference]: With dead ends: 749 [2020-09-04 21:37:52,703 INFO L226 Difference]: Without dead ends: 546 [2020-09-04 21:37:52,705 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:37:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-09-04 21:37:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 334. [2020-09-04 21:37:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-09-04 21:37:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 411 transitions. [2020-09-04 21:37:52,743 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 411 transitions. Word has length 190 [2020-09-04 21:37:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:52,743 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 411 transitions. [2020-09-04 21:37:52,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 21:37:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 411 transitions. [2020-09-04 21:37:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-09-04 21:37:52,745 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:52,746 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:52,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-09-04 21:37:52,746 INFO L427 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:52,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1087471382, now seen corresponding path program 3 times [2020-09-04 21:37:52,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:52,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [470312244] [2020-09-04 21:37:52,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:52,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-09-04 21:37:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-04 21:37:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-04 21:37:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 7 proven. 694 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:53,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [470312244] [2020-09-04 21:37:53,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:53,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 21:37:53,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031254873] [2020-09-04 21:37:53,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 21:37:53,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:53,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 21:37:53,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:37:53,396 INFO L87 Difference]: Start difference. First operand 334 states and 411 transitions. Second operand 21 states. [2020-09-04 21:37:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:54,409 INFO L93 Difference]: Finished difference Result 623 states and 777 transitions. [2020-09-04 21:37:54,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:37:54,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 190 [2020-09-04 21:37:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:54,412 INFO L225 Difference]: With dead ends: 623 [2020-09-04 21:37:54,412 INFO L226 Difference]: Without dead ends: 422 [2020-09-04 21:37:54,414 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-04 21:37:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-09-04 21:37:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 334. [2020-09-04 21:37:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-09-04 21:37:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 411 transitions. [2020-09-04 21:37:54,452 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 411 transitions. Word has length 190 [2020-09-04 21:37:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:54,452 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 411 transitions. [2020-09-04 21:37:54,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 21:37:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 411 transitions. [2020-09-04 21:37:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 21:37:54,454 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:54,455 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:54,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-09-04 21:37:54,455 INFO L427 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:54,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1276573760, now seen corresponding path program 4 times [2020-09-04 21:37:54,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:54,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1957732006] [2020-09-04 21:37:54,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 21:37:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 21:37:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:54,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 21:37:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 6 proven. 813 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:55,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1957732006] [2020-09-04 21:37:55,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:55,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 21:37:55,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545660127] [2020-09-04 21:37:55,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 21:37:55,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:55,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 21:37:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:37:55,003 INFO L87 Difference]: Start difference. First operand 334 states and 411 transitions. Second operand 22 states. [2020-09-04 21:37:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:55,368 INFO L93 Difference]: Finished difference Result 776 states and 936 transitions. [2020-09-04 21:37:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 21:37:55,368 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 195 [2020-09-04 21:37:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:55,372 INFO L225 Difference]: With dead ends: 776 [2020-09-04 21:37:55,372 INFO L226 Difference]: Without dead ends: 568 [2020-09-04 21:37:55,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 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-04 21:37:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-09-04 21:37:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 344. [2020-09-04 21:37:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-09-04 21:37:55,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 424 transitions. [2020-09-04 21:37:55,413 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 424 transitions. Word has length 195 [2020-09-04 21:37:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:55,413 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 424 transitions. [2020-09-04 21:37:55,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 21:37:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 424 transitions. [2020-09-04 21:37:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 21:37:55,415 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:55,415 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:55,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-09-04 21:37:55,415 INFO L427 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash -733813518, now seen corresponding path program 4 times [2020-09-04 21:37:55,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:55,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [884164448] [2020-09-04 21:37:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:55,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:56,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 21:37:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:56,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 21:37:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:56,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 21:37:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 7 proven. 779 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:56,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [884164448] [2020-09-04 21:37:56,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:56,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 21:37:56,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520675912] [2020-09-04 21:37:56,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 21:37:56,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:56,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 21:37:56,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2020-09-04 21:37:56,101 INFO L87 Difference]: Start difference. First operand 344 states and 424 transitions. Second operand 22 states. [2020-09-04 21:37:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:57,158 INFO L93 Difference]: Finished difference Result 642 states and 802 transitions. [2020-09-04 21:37:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 21:37:57,159 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 195 [2020-09-04 21:37:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:57,162 INFO L225 Difference]: With dead ends: 642 [2020-09-04 21:37:57,162 INFO L226 Difference]: Without dead ends: 436 [2020-09-04 21:37:57,163 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:37:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-09-04 21:37:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 344. [2020-09-04 21:37:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-09-04 21:37:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 424 transitions. [2020-09-04 21:37:57,206 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 424 transitions. Word has length 195 [2020-09-04 21:37:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:57,206 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 424 transitions. [2020-09-04 21:37:57,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 21:37:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 424 transitions. [2020-09-04 21:37:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 21:37:57,208 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:57,208 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:57,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-09-04 21:37:57,209 INFO L427 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:57,209 INFO L82 PathProgramCache]: Analyzing trace with hash -171452104, now seen corresponding path program 5 times [2020-09-04 21:37:57,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:57,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1918555551] [2020-09-04 21:37:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 21:37:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2020-09-04 21:37:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 21:37:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 6 proven. 905 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:37:57,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1918555551] [2020-09-04 21:37:57,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:57,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:37:57,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352041860] [2020-09-04 21:37:57,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:37:57,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:37:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:37:57,829 INFO L87 Difference]: Start difference. First operand 344 states and 424 transitions. Second operand 23 states. [2020-09-04 21:37:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:58,364 INFO L93 Difference]: Finished difference Result 803 states and 969 transitions. [2020-09-04 21:37:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:37:58,365 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 200 [2020-09-04 21:37:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:58,367 INFO L225 Difference]: With dead ends: 803 [2020-09-04 21:37:58,367 INFO L226 Difference]: Without dead ends: 590 [2020-09-04 21:37:58,369 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 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-04 21:37:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-09-04 21:37:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 354. [2020-09-04 21:37:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-09-04 21:37:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2020-09-04 21:37:58,411 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 200 [2020-09-04 21:37:58,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:58,411 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2020-09-04 21:37:58,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:37:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2020-09-04 21:37:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 21:37:58,413 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:58,413 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:37:58,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-09-04 21:37:58,414 INFO L427 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2113127914, now seen corresponding path program 5 times [2020-09-04 21:37:58,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:58,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847773887] [2020-09-04 21:37:58,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:37:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:58,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:37:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:59,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 21:37:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:59,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2020-09-04 21:37:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:59,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 21:37:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 7 proven. 869 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:37:59,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847773887] [2020-09-04 21:37:59,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:59,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:37:59,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721442320] [2020-09-04 21:37:59,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:37:59,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:59,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:37:59,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:37:59,185 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand 23 states. [2020-09-04 21:38:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:00,626 INFO L93 Difference]: Finished difference Result 661 states and 827 transitions. [2020-09-04 21:38:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:38:00,627 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 200 [2020-09-04 21:38:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:00,630 INFO L225 Difference]: With dead ends: 661 [2020-09-04 21:38:00,630 INFO L226 Difference]: Without dead ends: 450 [2020-09-04 21:38:00,632 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:38:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-09-04 21:38:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 354. [2020-09-04 21:38:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-09-04 21:38:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2020-09-04 21:38:00,697 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 200 [2020-09-04 21:38:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:00,698 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2020-09-04 21:38:00,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:38:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2020-09-04 21:38:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-04 21:38:00,702 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:00,702 INFO L422 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:00,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-09-04 21:38:00,703 INFO L427 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:00,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1093348544, now seen corresponding path program 6 times [2020-09-04 21:38:00,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:00,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1004008181] [2020-09-04 21:38:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:00,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:00,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:00,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 21:38:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 21:38:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-09-04 21:38:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 6 proven. 1002 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:01,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1004008181] [2020-09-04 21:38:01,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:01,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-04 21:38:01,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872999634] [2020-09-04 21:38:01,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 21:38:01,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:01,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 21:38:01,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:38:01,314 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand 24 states. [2020-09-04 21:38:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:01,832 INFO L93 Difference]: Finished difference Result 830 states and 1002 transitions. [2020-09-04 21:38:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 21:38:01,833 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 205 [2020-09-04 21:38:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:01,836 INFO L225 Difference]: With dead ends: 830 [2020-09-04 21:38:01,836 INFO L226 Difference]: Without dead ends: 612 [2020-09-04 21:38:01,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:38:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-09-04 21:38:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 364. [2020-09-04 21:38:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-09-04 21:38:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 450 transitions. [2020-09-04 21:38:01,882 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 450 transitions. Word has length 205 [2020-09-04 21:38:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:01,882 INFO L479 AbstractCegarLoop]: Abstraction has 364 states and 450 transitions. [2020-09-04 21:38:01,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 21:38:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 450 transitions. [2020-09-04 21:38:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-04 21:38:01,884 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:01,885 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:01,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-09-04 21:38:01,885 INFO L427 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1191231474, now seen corresponding path program 6 times [2020-09-04 21:38:01,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:01,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795868993] [2020-09-04 21:38:01,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:01,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:02,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 21:38:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:02,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 21:38:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:02,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-09-04 21:38:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 7 proven. 964 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:38:02,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795868993] [2020-09-04 21:38:02,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:02,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-04 21:38:02,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684223741] [2020-09-04 21:38:02,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 21:38:02,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:02,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 21:38:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:38:02,695 INFO L87 Difference]: Start difference. First operand 364 states and 450 transitions. Second operand 24 states. [2020-09-04 21:38:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:03,917 INFO L93 Difference]: Finished difference Result 680 states and 852 transitions. [2020-09-04 21:38:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 21:38:03,918 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 205 [2020-09-04 21:38:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:03,920 INFO L225 Difference]: With dead ends: 680 [2020-09-04 21:38:03,920 INFO L226 Difference]: Without dead ends: 464 [2020-09-04 21:38:03,921 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-04 21:38:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-09-04 21:38:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 364. [2020-09-04 21:38:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-09-04 21:38:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 450 transitions. [2020-09-04 21:38:03,964 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 450 transitions. Word has length 205 [2020-09-04 21:38:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:03,965 INFO L479 AbstractCegarLoop]: Abstraction has 364 states and 450 transitions. [2020-09-04 21:38:03,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 21:38:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 450 transitions. [2020-09-04 21:38:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-04 21:38:03,966 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:03,967 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:03,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-09-04 21:38:03,967 INFO L427 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:03,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1719328312, now seen corresponding path program 7 times [2020-09-04 21:38:03,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:03,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708312740] [2020-09-04 21:38:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-09-04 21:38:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-09-04 21:38:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-09-04 21:38:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 6 proven. 1104 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:04,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708312740] [2020-09-04 21:38:04,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:04,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-04 21:38:04,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543109149] [2020-09-04 21:38:04,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 21:38:04,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:04,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 21:38:04,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:38:04,616 INFO L87 Difference]: Start difference. First operand 364 states and 450 transitions. Second operand 25 states. [2020-09-04 21:38:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:05,109 INFO L93 Difference]: Finished difference Result 857 states and 1035 transitions. [2020-09-04 21:38:05,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 21:38:05,110 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 210 [2020-09-04 21:38:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:05,113 INFO L225 Difference]: With dead ends: 857 [2020-09-04 21:38:05,113 INFO L226 Difference]: Without dead ends: 634 [2020-09-04 21:38:05,114 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 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-04 21:38:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-09-04 21:38:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 374. [2020-09-04 21:38:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-09-04 21:38:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 463 transitions. [2020-09-04 21:38:05,161 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 463 transitions. Word has length 210 [2020-09-04 21:38:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:05,162 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 463 transitions. [2020-09-04 21:38:05,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 21:38:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 463 transitions. [2020-09-04 21:38:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-04 21:38:05,164 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:05,164 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:05,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-09-04 21:38:05,164 INFO L427 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:05,165 INFO L82 PathProgramCache]: Analyzing trace with hash -291058966, now seen corresponding path program 7 times [2020-09-04 21:38:05,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:05,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031731379] [2020-09-04 21:38:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-09-04 21:38:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-09-04 21:38:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-09-04 21:38:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 7 proven. 1064 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:38:06,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1031731379] [2020-09-04 21:38:06,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:06,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-04 21:38:06,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678950221] [2020-09-04 21:38:06,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 21:38:06,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:06,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 21:38:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:38:06,019 INFO L87 Difference]: Start difference. First operand 374 states and 463 transitions. Second operand 25 states. [2020-09-04 21:38:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:07,325 INFO L93 Difference]: Finished difference Result 699 states and 877 transitions. [2020-09-04 21:38:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 21:38:07,326 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 210 [2020-09-04 21:38:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:07,328 INFO L225 Difference]: With dead ends: 699 [2020-09-04 21:38:07,328 INFO L226 Difference]: Without dead ends: 478 [2020-09-04 21:38:07,329 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-04 21:38:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-09-04 21:38:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 374. [2020-09-04 21:38:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-09-04 21:38:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 463 transitions. [2020-09-04 21:38:07,377 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 463 transitions. Word has length 210 [2020-09-04 21:38:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:07,377 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 463 transitions. [2020-09-04 21:38:07,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 21:38:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 463 transitions. [2020-09-04 21:38:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-09-04 21:38:07,379 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:07,379 INFO L422 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:07,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-09-04 21:38:07,379 INFO L427 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:07,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:07,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1312616000, now seen corresponding path program 8 times [2020-09-04 21:38:07,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:07,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [10180965] [2020-09-04 21:38:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:08,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 21:38:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:08,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 21:38:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:08,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2020-09-04 21:38:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 6 proven. 1211 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:08,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [10180965] [2020-09-04 21:38:08,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:08,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-04 21:38:08,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85974669] [2020-09-04 21:38:08,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 21:38:08,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 21:38:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:38:08,109 INFO L87 Difference]: Start difference. First operand 374 states and 463 transitions. Second operand 26 states. [2020-09-04 21:38:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:08,641 INFO L93 Difference]: Finished difference Result 884 states and 1068 transitions. [2020-09-04 21:38:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 21:38:08,642 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2020-09-04 21:38:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:08,645 INFO L225 Difference]: With dead ends: 884 [2020-09-04 21:38:08,645 INFO L226 Difference]: Without dead ends: 656 [2020-09-04 21:38:08,646 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 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-04 21:38:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-09-04 21:38:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 384. [2020-09-04 21:38:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-09-04 21:38:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2020-09-04 21:38:08,695 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 215 [2020-09-04 21:38:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:08,696 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2020-09-04 21:38:08,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 21:38:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2020-09-04 21:38:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-09-04 21:38:08,697 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:08,697 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:08,698 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-09-04 21:38:08,698 INFO L427 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash -697771278, now seen corresponding path program 8 times [2020-09-04 21:38:08,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:08,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [83531306] [2020-09-04 21:38:08,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:08,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:08,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:08,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:09,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 21:38:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:09,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 21:38:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:09,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2020-09-04 21:38:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 7 proven. 1169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:38:09,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [83531306] [2020-09-04 21:38:09,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:09,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-04 21:38:09,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655683673] [2020-09-04 21:38:09,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 21:38:09,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:09,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 21:38:09,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:38:09,585 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand 26 states. [2020-09-04 21:38:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:11,203 INFO L93 Difference]: Finished difference Result 718 states and 902 transitions. [2020-09-04 21:38:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 21:38:11,204 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2020-09-04 21:38:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:11,206 INFO L225 Difference]: With dead ends: 718 [2020-09-04 21:38:11,206 INFO L226 Difference]: Without dead ends: 492 [2020-09-04 21:38:11,207 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-04 21:38:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-09-04 21:38:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 384. [2020-09-04 21:38:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-09-04 21:38:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2020-09-04 21:38:11,248 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 215 [2020-09-04 21:38:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:11,248 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2020-09-04 21:38:11,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 21:38:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2020-09-04 21:38:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-04 21:38:11,250 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:11,250 INFO L422 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:11,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-09-04 21:38:11,250 INFO L427 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1256956728, now seen corresponding path program 9 times [2020-09-04 21:38:11,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:11,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905855830] [2020-09-04 21:38:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-09-04 21:38:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-09-04 21:38:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-09-04 21:38:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 6 proven. 1323 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:11,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905855830] [2020-09-04 21:38:11,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:11,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-04 21:38:11,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95444571] [2020-09-04 21:38:11,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 21:38:11,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:11,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 21:38:11,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:38:11,935 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand 27 states. [2020-09-04 21:38:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:12,602 INFO L93 Difference]: Finished difference Result 911 states and 1101 transitions. [2020-09-04 21:38:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 21:38:12,603 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2020-09-04 21:38:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:12,606 INFO L225 Difference]: With dead ends: 911 [2020-09-04 21:38:12,606 INFO L226 Difference]: Without dead ends: 678 [2020-09-04 21:38:12,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:38:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-09-04 21:38:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 394. [2020-09-04 21:38:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-09-04 21:38:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2020-09-04 21:38:12,650 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 220 [2020-09-04 21:38:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:12,650 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2020-09-04 21:38:12,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 21:38:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2020-09-04 21:38:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-04 21:38:12,651 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:12,652 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:12,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-09-04 21:38:12,652 INFO L427 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:12,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:12,652 INFO L82 PathProgramCache]: Analyzing trace with hash -753430550, now seen corresponding path program 9 times [2020-09-04 21:38:12,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:12,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153501674] [2020-09-04 21:38:12,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:12,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:12,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:12,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:13,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-09-04 21:38:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:13,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-09-04 21:38:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:13,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-09-04 21:38:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 7 proven. 1279 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 21:38:13,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153501674] [2020-09-04 21:38:13,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:13,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-04 21:38:13,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564078183] [2020-09-04 21:38:13,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 21:38:13,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:13,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 21:38:13,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:38:13,583 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 27 states. [2020-09-04 21:38:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:15,362 INFO L93 Difference]: Finished difference Result 737 states and 927 transitions. [2020-09-04 21:38:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 21:38:15,363 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2020-09-04 21:38:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:15,365 INFO L225 Difference]: With dead ends: 737 [2020-09-04 21:38:15,365 INFO L226 Difference]: Without dead ends: 506 [2020-09-04 21:38:15,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:38:15,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-09-04 21:38:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 394. [2020-09-04 21:38:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-09-04 21:38:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2020-09-04 21:38:15,418 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 220 [2020-09-04 21:38:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:15,419 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2020-09-04 21:38:15,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 21:38:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2020-09-04 21:38:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 21:38:15,420 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:15,421 INFO L422 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:15,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-09-04 21:38:15,421 INFO L427 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:15,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:15,421 INFO L82 PathProgramCache]: Analyzing trace with hash -629192384, now seen corresponding path program 10 times [2020-09-04 21:38:15,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:15,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1417748613] [2020-09-04 21:38:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 21:38:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 6 proven. 1440 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 21:38:16,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1417748613] [2020-09-04 21:38:16,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:16,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-09-04 21:38:16,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408053713] [2020-09-04 21:38:16,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 21:38:16,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:16,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 21:38:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:38:16,223 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 28 states. [2020-09-04 21:38:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:16,929 INFO L93 Difference]: Finished difference Result 938 states and 1134 transitions. [2020-09-04 21:38:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 21:38:16,930 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-09-04 21:38:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:16,933 INFO L225 Difference]: With dead ends: 938 [2020-09-04 21:38:16,933 INFO L226 Difference]: Without dead ends: 700 [2020-09-04 21:38:16,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=405, Invalid=407, Unknown=0, NotChecked=0, Total=812 [2020-09-04 21:38:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2020-09-04 21:38:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 404. [2020-09-04 21:38:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-09-04 21:38:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 502 transitions. [2020-09-04 21:38:16,984 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 502 transitions. Word has length 225 [2020-09-04 21:38:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:16,984 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 502 transitions. [2020-09-04 21:38:16,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 21:38:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 502 transitions. [2020-09-04 21:38:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 21:38:16,986 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:16,986 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:16,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-09-04 21:38:16,986 INFO L427 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:16,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1655387634, now seen corresponding path program 10 times [2020-09-04 21:38:16,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:16,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [717713935] [2020-09-04 21:38:16,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 21:38:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-09-04 21:38:17,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [717713935] [2020-09-04 21:38:17,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:17,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:38:17,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206146735] [2020-09-04 21:38:17,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:38:17,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:17,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:38:17,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:17,325 INFO L87 Difference]: Start difference. First operand 404 states and 502 transitions. Second operand 10 states. [2020-09-04 21:38:17,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:17,638 INFO L93 Difference]: Finished difference Result 459 states and 581 transitions. [2020-09-04 21:38:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:38:17,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 225 [2020-09-04 21:38:17,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:17,643 INFO L225 Difference]: With dead ends: 459 [2020-09-04 21:38:17,643 INFO L226 Difference]: Without dead ends: 453 [2020-09-04 21:38:17,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:38:17,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2020-09-04 21:38:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 430. [2020-09-04 21:38:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-09-04 21:38:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 540 transitions. [2020-09-04 21:38:17,702 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 540 transitions. Word has length 225 [2020-09-04 21:38:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:17,702 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 540 transitions. [2020-09-04 21:38:17,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:38:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 540 transitions. [2020-09-04 21:38:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-09-04 21:38:17,704 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:17,705 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:17,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-09-04 21:38:17,705 INFO L427 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:17,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:17,705 INFO L82 PathProgramCache]: Analyzing trace with hash -131719239, now seen corresponding path program 1 times [2020-09-04 21:38:17,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:17,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141817100] [2020-09-04 21:38:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 21:38:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-09-04 21:38:18,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141817100] [2020-09-04 21:38:18,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:18,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:38:18,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731924245] [2020-09-04 21:38:18,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:38:18,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:18,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:38:18,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:38:18,052 INFO L87 Difference]: Start difference. First operand 430 states and 540 transitions. Second operand 12 states. [2020-09-04 21:38:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:18,405 INFO L93 Difference]: Finished difference Result 459 states and 579 transitions. [2020-09-04 21:38:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:38:18,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 227 [2020-09-04 21:38:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:18,408 INFO L225 Difference]: With dead ends: 459 [2020-09-04 21:38:18,409 INFO L226 Difference]: Without dead ends: 452 [2020-09-04 21:38:18,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:38:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-09-04 21:38:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 438. [2020-09-04 21:38:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-09-04 21:38:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 549 transitions. [2020-09-04 21:38:18,481 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 549 transitions. Word has length 227 [2020-09-04 21:38:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:18,481 INFO L479 AbstractCegarLoop]: Abstraction has 438 states and 549 transitions. [2020-09-04 21:38:18,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:38:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 549 transitions. [2020-09-04 21:38:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-09-04 21:38:18,483 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:18,483 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:18,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-09-04 21:38:18,484 INFO L427 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:18,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1678288039, now seen corresponding path program 1 times [2020-09-04 21:38:18,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:18,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [103282420] [2020-09-04 21:38:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 21:38:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2020-09-04 21:38:18,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [103282420] [2020-09-04 21:38:18,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:38:18,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 21:38:18,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495987303] [2020-09-04 21:38:18,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:38:18,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:18,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:38:18,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:38:18,692 INFO L87 Difference]: Start difference. First operand 438 states and 549 transitions. Second operand 6 states. [2020-09-04 21:38:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:18,794 INFO L93 Difference]: Finished difference Result 444 states and 554 transitions. [2020-09-04 21:38:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:38:18,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2020-09-04 21:38:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:18,797 INFO L225 Difference]: With dead ends: 444 [2020-09-04 21:38:18,797 INFO L226 Difference]: Without dead ends: 432 [2020-09-04 21:38:18,798 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-04 21:38:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-09-04 21:38:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-09-04 21:38:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-09-04 21:38:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 541 transitions. [2020-09-04 21:38:18,865 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 541 transitions. Word has length 227 [2020-09-04 21:38:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:18,865 INFO L479 AbstractCegarLoop]: Abstraction has 432 states and 541 transitions. [2020-09-04 21:38:18,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:38:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 541 transitions. [2020-09-04 21:38:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-09-04 21:38:18,867 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:18,868 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:18,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-09-04 21:38:18,868 INFO L427 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 947853182, now seen corresponding path program 1 times [2020-09-04 21:38:18,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:18,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705968721] [2020-09-04 21:38:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:38:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-09-04 21:38:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 21:38:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 21:38:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2020-09-04 21:38:19,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705968721] [2020-09-04 21:38:19,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:19,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-04 21:38:19,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845095802] [2020-09-04 21:38:19,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:38:19,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:19,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:38:19,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:38:19,090 INFO L87 Difference]: Start difference. First operand 432 states and 541 transitions. Second operand 5 states. [2020-09-04 21:38:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:19,240 INFO L93 Difference]: Finished difference Result 691 states and 868 transitions. [2020-09-04 21:38:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:38:19,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2020-09-04 21:38:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:19,243 INFO L225 Difference]: With dead ends: 691 [2020-09-04 21:38:19,243 INFO L226 Difference]: Without dead ends: 280 [2020-09-04 21:38:19,245 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-04 21:38:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-09-04 21:38:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2020-09-04 21:38:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-09-04 21:38:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 327 transitions. [2020-09-04 21:38:19,282 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 327 transitions. Word has length 230 [2020-09-04 21:38:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:19,282 INFO L479 AbstractCegarLoop]: Abstraction has 263 states and 327 transitions. [2020-09-04 21:38:19,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:38:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 327 transitions. [2020-09-04 21:38:19,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-09-04 21:38:19,284 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:19,284 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:19,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-09-04 21:38:19,284 INFO L427 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:19,285 INFO L82 PathProgramCache]: Analyzing trace with hash -671277925, now seen corresponding path program 1 times [2020-09-04 21:38:19,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:19,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2058080835] [2020-09-04 21:38:19,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 21:38:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2020-09-04 21:38:19,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2058080835] [2020-09-04 21:38:19,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:38:19,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 21:38:19,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885407682] [2020-09-04 21:38:19,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:38:19,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:19,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:38:19,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:38:19,502 INFO L87 Difference]: Start difference. First operand 263 states and 327 transitions. Second operand 8 states. [2020-09-04 21:38:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:19,635 INFO L93 Difference]: Finished difference Result 317 states and 389 transitions. [2020-09-04 21:38:19,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:38:19,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2020-09-04 21:38:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:19,638 INFO L225 Difference]: With dead ends: 317 [2020-09-04 21:38:19,638 INFO L226 Difference]: Without dead ends: 298 [2020-09-04 21:38:19,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:38:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-09-04 21:38:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 269. [2020-09-04 21:38:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-09-04 21:38:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2020-09-04 21:38:19,697 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 236 [2020-09-04 21:38:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:19,697 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2020-09-04 21:38:19,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:38:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2020-09-04 21:38:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-09-04 21:38:19,699 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:19,699 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:19,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-09-04 21:38:19,700 INFO L427 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:19,700 INFO L82 PathProgramCache]: Analyzing trace with hash 287100319, now seen corresponding path program 1 times [2020-09-04 21:38:19,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:19,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1773840495] [2020-09-04 21:38:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:19,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-09-04 21:38:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1415 trivial. 0 not checked. [2020-09-04 21:38:20,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1773840495] [2020-09-04 21:38:20,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:20,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:38:20,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676912967] [2020-09-04 21:38:20,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:38:20,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:20,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:38:20,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:38:20,110 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 13 states. [2020-09-04 21:38:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:20,475 INFO L93 Difference]: Finished difference Result 346 states and 421 transitions. [2020-09-04 21:38:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:38:20,476 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2020-09-04 21:38:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:20,478 INFO L225 Difference]: With dead ends: 346 [2020-09-04 21:38:20,479 INFO L226 Difference]: Without dead ends: 334 [2020-09-04 21:38:20,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:38:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-09-04 21:38:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 308. [2020-09-04 21:38:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-09-04 21:38:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 379 transitions. [2020-09-04 21:38:20,553 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 379 transitions. Word has length 240 [2020-09-04 21:38:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:20,553 INFO L479 AbstractCegarLoop]: Abstraction has 308 states and 379 transitions. [2020-09-04 21:38:20,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:38:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 379 transitions. [2020-09-04 21:38:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-09-04 21:38:20,555 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:20,555 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:20,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-09-04 21:38:20,556 INFO L427 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1150729662, now seen corresponding path program 1 times [2020-09-04 21:38:20,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:20,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [762010134] [2020-09-04 21:38:20,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:20,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:20,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:20,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:20,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:20,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 21:38:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:20,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-09-04 21:38:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-09-04 21:38:20,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [762010134] [2020-09-04 21:38:20,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:20,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:38:20,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587959803] [2020-09-04 21:38:20,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:38:20,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:20,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:38:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:20,859 INFO L87 Difference]: Start difference. First operand 308 states and 379 transitions. Second operand 10 states. [2020-09-04 21:38:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:21,139 INFO L93 Difference]: Finished difference Result 320 states and 390 transitions. [2020-09-04 21:38:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:38:21,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 243 [2020-09-04 21:38:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:21,142 INFO L225 Difference]: With dead ends: 320 [2020-09-04 21:38:21,142 INFO L226 Difference]: Without dead ends: 294 [2020-09-04 21:38:21,142 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:38:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-09-04 21:38:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 265. [2020-09-04 21:38:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-09-04 21:38:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 302 transitions. [2020-09-04 21:38:21,183 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 302 transitions. Word has length 243 [2020-09-04 21:38:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:21,183 INFO L479 AbstractCegarLoop]: Abstraction has 265 states and 302 transitions. [2020-09-04 21:38:21,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:38:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 302 transitions. [2020-09-04 21:38:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-09-04 21:38:21,185 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:21,185 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:21,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-09-04 21:38:21,186 INFO L427 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:21,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:21,186 INFO L82 PathProgramCache]: Analyzing trace with hash 661117091, now seen corresponding path program 2 times [2020-09-04 21:38:21,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:21,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1088642850] [2020-09-04 21:38:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-09-04 21:38:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2020-09-04 21:38:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2020-09-04 21:38:21,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1088642850] [2020-09-04 21:38:21,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:21,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:38:21,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767031904] [2020-09-04 21:38:21,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:38:21,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:21,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:38:21,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:38:21,544 INFO L87 Difference]: Start difference. First operand 265 states and 302 transitions. Second operand 11 states. [2020-09-04 21:38:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:21,802 INFO L93 Difference]: Finished difference Result 333 states and 378 transitions. [2020-09-04 21:38:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:38:21,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 244 [2020-09-04 21:38:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:21,804 INFO L225 Difference]: With dead ends: 333 [2020-09-04 21:38:21,805 INFO L226 Difference]: Without dead ends: 268 [2020-09-04 21:38:21,805 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:38:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-09-04 21:38:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2020-09-04 21:38:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-09-04 21:38:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 305 transitions. [2020-09-04 21:38:21,853 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 305 transitions. Word has length 244 [2020-09-04 21:38:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:21,854 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 305 transitions. [2020-09-04 21:38:21,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:38:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 305 transitions. [2020-09-04 21:38:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-09-04 21:38:21,855 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:21,856 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:21,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-09-04 21:38:21,856 INFO L427 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:21,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:21,856 INFO L82 PathProgramCache]: Analyzing trace with hash -229943887, now seen corresponding path program 1 times [2020-09-04 21:38:21,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:21,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1648314534] [2020-09-04 21:38:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 21:38:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-09-04 21:38:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-09-04 21:38:22,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1648314534] [2020-09-04 21:38:22,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:22,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:38:22,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578825959] [2020-09-04 21:38:22,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:38:22,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:22,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:38:22,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:38:22,394 INFO L87 Difference]: Start difference. First operand 268 states and 305 transitions. Second operand 14 states. [2020-09-04 21:38:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:22,900 INFO L93 Difference]: Finished difference Result 324 states and 366 transitions. [2020-09-04 21:38:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:38:22,901 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 245 [2020-09-04 21:38:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:22,902 INFO L225 Difference]: With dead ends: 324 [2020-09-04 21:38:22,903 INFO L226 Difference]: Without dead ends: 312 [2020-09-04 21:38:22,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:38:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-09-04 21:38:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2020-09-04 21:38:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-09-04 21:38:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 346 transitions. [2020-09-04 21:38:22,963 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 346 transitions. Word has length 245 [2020-09-04 21:38:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:22,965 INFO L479 AbstractCegarLoop]: Abstraction has 304 states and 346 transitions. [2020-09-04 21:38:22,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:38:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 346 transitions. [2020-09-04 21:38:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-09-04 21:38:22,966 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:22,967 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:22,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-09-04 21:38:22,967 INFO L427 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:22,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash 818281555, now seen corresponding path program 1 times [2020-09-04 21:38:22,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:22,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980147771] [2020-09-04 21:38:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 21:38:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2020-09-04 21:38:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2020-09-04 21:38:23,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [980147771] [2020-09-04 21:38:23,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:23,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:38:23,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364247135] [2020-09-04 21:38:23,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:38:23,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:23,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:38:23,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:38:23,567 INFO L87 Difference]: Start difference. First operand 304 states and 346 transitions. Second operand 11 states. [2020-09-04 21:38:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:23,863 INFO L93 Difference]: Finished difference Result 316 states and 357 transitions. [2020-09-04 21:38:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:38:23,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 246 [2020-09-04 21:38:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:23,866 INFO L225 Difference]: With dead ends: 316 [2020-09-04 21:38:23,866 INFO L226 Difference]: Without dead ends: 275 [2020-09-04 21:38:23,867 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:38:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-09-04 21:38:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2020-09-04 21:38:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-09-04 21:38:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 304 transitions. [2020-09-04 21:38:23,929 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 304 transitions. Word has length 246 [2020-09-04 21:38:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:23,930 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 304 transitions. [2020-09-04 21:38:23,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:38:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 304 transitions. [2020-09-04 21:38:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-09-04 21:38:23,931 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:23,932 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 4, 4, 4, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:38:23,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-09-04 21:38:23,932 INFO L427 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:23,932 INFO L82 PathProgramCache]: Analyzing trace with hash -360487828, now seen corresponding path program 1 times [2020-09-04 21:38:23,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:23,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1286876200] [2020-09-04 21:38:23,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:38:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:38:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 21:38:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 21:38:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-09-04 21:38:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2020-09-04 21:38:24,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1286876200] [2020-09-04 21:38:24,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:24,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:38:24,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466012440] [2020-09-04 21:38:24,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:38:24,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:24,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:38:24,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:38:24,410 INFO L87 Difference]: Start difference. First operand 268 states and 304 transitions. Second operand 12 states. [2020-09-04 21:38:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:24,812 INFO L93 Difference]: Finished difference Result 268 states and 304 transitions. [2020-09-04 21:38:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:38:24,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 248 [2020-09-04 21:38:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:24,814 INFO L225 Difference]: With dead ends: 268 [2020-09-04 21:38:24,815 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:38:24,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:38:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:38:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:38:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:38:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:38:24,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2020-09-04 21:38:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:24,818 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:38:24,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:38:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:38:24,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:38:24,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-09-04 21:38:24,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:38:26,678 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 21:38:33,759 WARN L193 SmtUtils]: Spent 7.08 s on a formula simplification. DAG size of input: 492 DAG size of output: 4 [2020-09-04 21:38:44,445 WARN L193 SmtUtils]: Spent 10.68 s on a formula simplification. DAG size of input: 561 DAG size of output: 4 [2020-09-04 21:38:46,209 WARN L193 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 282 DAG size of output: 4 [2020-09-04 21:38:47,370 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 231 DAG size of output: 4 [2020-09-04 21:38:47,669 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 4 [2020-09-04 21:38:52,551 WARN L193 SmtUtils]: Spent 4.87 s on a formula simplification. DAG size of input: 427 DAG size of output: 4 [2020-09-04 21:38:55,410 WARN L193 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 337 DAG size of output: 4 [2020-09-04 21:39:04,055 WARN L193 SmtUtils]: Spent 8.64 s on a formula simplification. DAG size of input: 526 DAG size of output: 4 [2020-09-04 21:39:04,682 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 4 [2020-09-04 21:39:04,830 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 4 [2020-09-04 21:39:15,445 WARN L193 SmtUtils]: Spent 10.61 s on a formula simplification. DAG size of input: 592 DAG size of output: 4 [2020-09-04 21:39:16,787 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 21:39:22,640 WARN L193 SmtUtils]: Spent 5.83 s on a formula simplification. DAG size of input: 459 DAG size of output: 4 [2020-09-04 21:39:24,822 WARN L193 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 309 DAG size of output: 4 [2020-09-04 21:39:26,215 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 256 DAG size of output: 4 [2020-09-04 21:39:27,058 WARN L193 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 4 [2020-09-04 21:39:37,642 WARN L193 SmtUtils]: Spent 10.58 s on a formula simplification. DAG size of input: 592 DAG size of output: 4 [2020-09-04 21:39:39,139 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 586 DAG size of output: 137 [2020-09-04 21:39:39,483 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 4 [2020-09-04 21:39:43,558 WARN L193 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 396 DAG size of output: 4 [2020-09-04 21:39:46,809 WARN L193 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 366 DAG size of output: 4 [2020-09-04 21:39:47,270 WARN L193 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 4 [2020-09-04 21:39:58,992 WARN L193 SmtUtils]: Spent 11.72 s on a formula simplification. DAG size of input: 601 DAG size of output: 8 [2020-09-04 21:40:00,357 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 21:40:01,704 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 21:40:03,208 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 21:40:12,261 WARN L193 SmtUtils]: Spent 9.05 s on a formula simplification. DAG size of input: 499 DAG size of output: 4 [2020-09-04 21:40:24,892 WARN L193 SmtUtils]: Spent 12.63 s on a formula simplification. DAG size of input: 568 DAG size of output: 4 [2020-09-04 21:40:27,109 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 289 DAG size of output: 4 [2020-09-04 21:40:28,456 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 238 DAG size of output: 4 [2020-09-04 21:40:28,762 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 4 [2020-09-04 21:40:35,287 WARN L193 SmtUtils]: Spent 6.52 s on a formula simplification. DAG size of input: 434 DAG size of output: 4 [2020-09-04 21:40:38,761 WARN L193 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 344 DAG size of output: 4 [2020-09-04 21:40:49,320 WARN L193 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 533 DAG size of output: 4 [2020-09-04 21:40:50,091 WARN L193 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 4 [2020-09-04 21:40:50,258 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 4 [2020-09-04 21:41:05,986 WARN L193 SmtUtils]: Spent 15.73 s on a formula simplification. DAG size of input: 571 DAG size of output: 4 [2020-09-04 21:41:07,163 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 21:41:14,802 WARN L193 SmtUtils]: Spent 7.62 s on a formula simplification. DAG size of input: 466 DAG size of output: 4 [2020-09-04 21:41:17,606 WARN L193 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 316 DAG size of output: 4 [2020-09-04 21:41:19,369 WARN L193 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 263 DAG size of output: 4 [2020-09-04 21:41:20,370 WARN L193 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 4 [2020-09-04 21:41:36,409 WARN L193 SmtUtils]: Spent 16.03 s on a formula simplification. DAG size of input: 571 DAG size of output: 4 [2020-09-04 21:41:36,790 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 4 [2020-09-04 21:41:42,201 WARN L193 SmtUtils]: Spent 5.41 s on a formula simplification. DAG size of input: 403 DAG size of output: 4 [2020-09-04 21:41:46,463 WARN L193 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 373 DAG size of output: 4 [2020-09-04 21:41:46,994 WARN L193 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 4 [2020-09-04 21:42:02,661 WARN L193 SmtUtils]: Spent 15.67 s on a formula simplification. DAG size of input: 578 DAG size of output: 8 [2020-09-04 21:42:03,811 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 21:42:04,954 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 21:42:06,290 WARN L193 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 21:42:07,259 WARN L193 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 4 [2020-09-04 21:42:08,390 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 161 DAG size of output: 4 [2020-09-04 21:42:08,815 WARN L193 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 4 [2020-09-04 21:42:09,130 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 4 [2020-09-04 21:42:09,303 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 4 [2020-09-04 21:42:10,096 WARN L193 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 4 [2020-09-04 21:42:10,637 WARN L193 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 4 [2020-09-04 21:42:11,715 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 155 DAG size of output: 4 [2020-09-04 21:42:11,940 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 4 [2020-09-04 21:42:13,201 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 164 DAG size of output: 4 [2020-09-04 21:42:13,945 WARN L193 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 21:42:14,844 WARN L193 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 4 [2020-09-04 21:42:15,317 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 4 [2020-09-04 21:42:15,729 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 4 [2020-09-04 21:42:16,012 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 4 [2020-09-04 21:42:17,178 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 164 DAG size of output: 4 [2020-09-04 21:42:17,924 WARN L193 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 21:42:18,074 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 4 [2020-09-04 21:42:18,772 WARN L193 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 4 [2020-09-04 21:42:19,382 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 4 [2020-09-04 21:42:19,571 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 4 [2020-09-04 21:42:20,829 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 171 DAG size of output: 4 [2020-09-04 21:42:21,582 WARN L193 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 21:42:22,324 WARN L193 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 21:42:22,998 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 21:42:23,240 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 4 [2020-09-04 21:42:23,528 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 4 [2020-09-04 21:42:23,642 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 4 [2020-09-04 21:42:23,990 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 4 [2020-09-04 21:42:24,139 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 4 [2020-09-04 21:42:24,402 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 4 [2020-09-04 21:42:24,785 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 4 [2020-09-04 21:42:25,003 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 21:42:25,295 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 4 [2020-09-04 21:42:25,425 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 4 [2020-09-04 21:42:25,526 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 4 [2020-09-04 21:42:25,910 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 4 [2020-09-04 21:42:26,130 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 21:42:26,359 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 4 [2020-09-04 21:42:26,521 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 4 [2020-09-04 21:42:26,892 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 4 [2020-09-04 21:42:27,119 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 21:42:27,340 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 21:43:24,562 WARN L193 SmtUtils]: Spent 56.79 s on a formula simplification. DAG size of input: 1153 DAG size of output: 991 [2020-09-04 21:44:22,646 WARN L193 SmtUtils]: Spent 58.08 s on a formula simplification. DAG size of input: 957 DAG size of output: 9 [2020-09-04 21:45:50,235 WARN L193 SmtUtils]: Spent 1.46 m on a formula simplification. DAG size of input: 1093 DAG size of output: 9 [2020-09-04 21:46:02,415 WARN L193 SmtUtils]: Spent 12.18 s on a formula simplification. DAG size of input: 545 DAG size of output: 9 [2020-09-04 21:46:09,267 WARN L193 SmtUtils]: Spent 6.85 s on a formula simplification. DAG size of input: 445 DAG size of output: 9 [2020-09-04 21:46:09,497 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 9 [2020-09-04 21:46:10,612 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 231 DAG size of output: 9 [2020-09-04 21:46:48,179 WARN L193 SmtUtils]: Spent 37.55 s on a formula simplification. DAG size of input: 829 DAG size of output: 9 [2020-09-04 21:47:07,956 WARN L193 SmtUtils]: Spent 19.77 s on a formula simplification. DAG size of input: 653 DAG size of output: 9 [2020-09-04 21:48:18,421 WARN L193 SmtUtils]: Spent 1.17 m on a formula simplification. DAG size of input: 1024 DAG size of output: 9 [2020-09-04 21:48:22,024 WARN L193 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 353 DAG size of output: 9 [2020-09-04 21:48:22,719 WARN L193 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 9 [2020-09-04 21:50:00,389 WARN L193 SmtUtils]: Spent 1.63 m on a formula simplification. DAG size of input: 1135 DAG size of output: 9 [2020-09-04 21:50:57,237 WARN L193 SmtUtils]: Spent 56.85 s on a formula simplification. DAG size of input: 1153 DAG size of output: 991