/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:11:50,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:11:50,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:11:50,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:11:50,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:11:50,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:11:50,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:11:50,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:11:50,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:11:50,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:11:50,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:11:50,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:11:50,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:11:50,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:11:50,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:11:50,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:11:50,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:11:50,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:11:50,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:11:50,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:11:50,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:11:50,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:11:50,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:11:50,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:11:50,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:11:50,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:11:50,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:11:50,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:11:50,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:11:50,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:11:50,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:11:50,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:11:50,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:11:50,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:11:50,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:11:50,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:11:50,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:11:50,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:11:50,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:11:50,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:11:50,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:11:50,805 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 16:11:50,820 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:11:50,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:11:50,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:11:50,823 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:11:50,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:11:50,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:11:50,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:11:50,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:11:50,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:11:50,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:11:50,825 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:11:50,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:11:50,826 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:11:50,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:11:50,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:11:50,827 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:11:50,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:11:50,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:11:50,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:11:50,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:11:50,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:11:50,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:11:50,828 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:11:51,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:11:51,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:11:51,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:11:51,302 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:11:51,303 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:11:51,304 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2020-09-04 16:11:51,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a5fcb149b/1f668393b3ad4d6d8f90cf9d558143c4/FLAGb9804ae8e [2020-09-04 16:11:51,948 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:11:51,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2020-09-04 16:11:51,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a5fcb149b/1f668393b3ad4d6d8f90cf9d558143c4/FLAGb9804ae8e [2020-09-04 16:11:52,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a5fcb149b/1f668393b3ad4d6d8f90cf9d558143c4 [2020-09-04 16:11:52,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:11:52,294 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:11:52,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:11:52,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:11:52,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:11:52,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:11:52" (1/1) ... [2020-09-04 16:11:52,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9fea37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52, skipping insertion in model container [2020-09-04 16:11:52,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:11:52" (1/1) ... [2020-09-04 16:11:52,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:11:52,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:11:52,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:11:52,680 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:11:52,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:11:52,750 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:11:52,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52 WrapperNode [2020-09-04 16:11:52,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:11:52,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:11:52,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:11:52,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:11:52,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52" (1/1) ... [2020-09-04 16:11:52,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52" (1/1) ... [2020-09-04 16:11:52,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52" (1/1) ... [2020-09-04 16:11:52,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52" (1/1) ... [2020-09-04 16:11:52,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52" (1/1) ... [2020-09-04 16:11:52,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52" (1/1) ... [2020-09-04 16:11:52,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52" (1/1) ... [2020-09-04 16:11:52,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:11:52,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:11:52,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:11:52,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:11:52,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52" (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 16:11:52,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:11:52,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:11:52,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 16:11:52,961 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2020-09-04 16:11:52,961 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2020-09-04 16:11:52,961 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2020-09-04 16:11:52,961 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:11:52,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:11:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-04 16:11:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 16:11:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 16:11:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2020-09-04 16:11:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2020-09-04 16:11:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2020-09-04 16:11:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:11:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:11:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:11:53,553 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:11:53,554 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 16:11:53,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:11:53 BoogieIcfgContainer [2020-09-04 16:11:53,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:11:53,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:11:53,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:11:53,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:11:53,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:11:52" (1/3) ... [2020-09-04 16:11:53,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a6d7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:11:53, skipping insertion in model container [2020-09-04 16:11:53,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:11:52" (2/3) ... [2020-09-04 16:11:53,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a6d7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:11:53, skipping insertion in model container [2020-09-04 16:11:53,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:11:53" (3/3) ... [2020-09-04 16:11:53,578 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2020-09-04 16:11:53,590 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:11:53,600 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:11:53,624 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:11:53,655 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:11:53,655 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:11:53,656 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:11:53,656 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:11:53,656 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:11:53,656 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:11:53,656 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:11:53,657 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:11:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2020-09-04 16:11:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-09-04 16:11:53,702 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:53,704 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 16:11:53,704 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:53,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:53,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2062280112, now seen corresponding path program 1 times [2020-09-04 16:11:53,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:53,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2109278517] [2020-09-04 16:11:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:53,797 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:53,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 16:11:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 16:11:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 16:11:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,141 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 16:11:54,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2109278517] [2020-09-04 16:11:54,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:54,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 16:11:54,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858973746] [2020-09-04 16:11:54,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 16:11:54,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:54,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 16:11:54,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 16:11:54,174 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2020-09-04 16:11:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:54,369 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2020-09-04 16:11:54,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:11:54,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-09-04 16:11:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:54,390 INFO L225 Difference]: With dead ends: 286 [2020-09-04 16:11:54,390 INFO L226 Difference]: Without dead ends: 168 [2020-09-04 16:11:54,396 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 16:11:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-09-04 16:11:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 145. [2020-09-04 16:11:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-09-04 16:11:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2020-09-04 16:11:54,488 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 100 [2020-09-04 16:11:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:54,489 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2020-09-04 16:11:54,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 16:11:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2020-09-04 16:11:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-04 16:11:54,496 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:54,496 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 16:11:54,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:11:54,497 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1947593625, now seen corresponding path program 1 times [2020-09-04 16:11:54,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:54,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [760475313] [2020-09-04 16:11:54,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:54,501 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 16:11:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 16:11:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 16:11:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:54,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [760475313] [2020-09-04 16:11:54,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:54,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 16:11:54,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41429376] [2020-09-04 16:11:54,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 16:11:54,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:54,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 16:11:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 16:11:54,655 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand 4 states. [2020-09-04 16:11:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:54,782 INFO L93 Difference]: Finished difference Result 278 states and 331 transitions. [2020-09-04 16:11:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 16:11:54,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-09-04 16:11:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:54,786 INFO L225 Difference]: With dead ends: 278 [2020-09-04 16:11:54,786 INFO L226 Difference]: Without dead ends: 169 [2020-09-04 16:11:54,789 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 16:11:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-09-04 16:11:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2020-09-04 16:11:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-09-04 16:11:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2020-09-04 16:11:54,817 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 103 [2020-09-04 16:11:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:54,817 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2020-09-04 16:11:54,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 16:11:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2020-09-04 16:11:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 16:11:54,823 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:54,823 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 16:11:54,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:11:54,823 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:54,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1622356113, now seen corresponding path program 1 times [2020-09-04 16:11:54,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:54,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [197093886] [2020-09-04 16:11:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:54,827 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 16:11:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 16:11:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 16:11:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:54,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [197093886] [2020-09-04 16:11:54,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:54,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:11:54,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240331388] [2020-09-04 16:11:54,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:11:54,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:11:54,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:11:54,972 INFO L87 Difference]: Start difference. First operand 157 states and 185 transitions. Second operand 5 states. [2020-09-04 16:11:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:55,088 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2020-09-04 16:11:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:11:55,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-04 16:11:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:55,093 INFO L225 Difference]: With dead ends: 314 [2020-09-04 16:11:55,093 INFO L226 Difference]: Without dead ends: 192 [2020-09-04 16:11:55,094 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 16:11:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-09-04 16:11:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 173. [2020-09-04 16:11:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-09-04 16:11:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2020-09-04 16:11:55,121 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 108 [2020-09-04 16:11:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:55,121 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2020-09-04 16:11:55,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:11:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2020-09-04 16:11:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 16:11:55,127 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:55,127 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 16:11:55,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:11:55,131 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1409900093, now seen corresponding path program 1 times [2020-09-04 16:11:55,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:55,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [898100931] [2020-09-04 16:11:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:55,134 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 16:11:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 16:11:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 16:11:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:55,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [898100931] [2020-09-04 16:11:55,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:55,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:11:55,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642682534] [2020-09-04 16:11:55,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:11:55,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:55,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:11:55,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:11:55,435 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 5 states. [2020-09-04 16:11:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:55,559 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2020-09-04 16:11:55,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:11:55,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-04 16:11:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:55,566 INFO L225 Difference]: With dead ends: 314 [2020-09-04 16:11:55,566 INFO L226 Difference]: Without dead ends: 194 [2020-09-04 16:11:55,568 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 16:11:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-09-04 16:11:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2020-09-04 16:11:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-09-04 16:11:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 207 transitions. [2020-09-04 16:11:55,621 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 207 transitions. Word has length 108 [2020-09-04 16:11:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:55,622 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 207 transitions. [2020-09-04 16:11:55,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:11:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 207 transitions. [2020-09-04 16:11:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-04 16:11:55,628 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:55,629 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 16:11:55,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:11:55,630 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2129807001, now seen corresponding path program 2 times [2020-09-04 16:11:55,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:55,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1731239024] [2020-09-04 16:11:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:55,637 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 16:11:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 16:11:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 16:11:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:55,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1731239024] [2020-09-04 16:11:55,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:55,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:11:55,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303086535] [2020-09-04 16:11:55,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:11:55,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:11:55,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:11:55,815 INFO L87 Difference]: Start difference. First operand 176 states and 207 transitions. Second operand 6 states. [2020-09-04 16:11:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:55,931 INFO L93 Difference]: Finished difference Result 348 states and 416 transitions. [2020-09-04 16:11:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:11:55,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-09-04 16:11:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:55,934 INFO L225 Difference]: With dead ends: 348 [2020-09-04 16:11:55,934 INFO L226 Difference]: Without dead ends: 218 [2020-09-04 16:11:55,936 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 16:11:55,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-09-04 16:11:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 186. [2020-09-04 16:11:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-09-04 16:11:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2020-09-04 16:11:55,959 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 113 [2020-09-04 16:11:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:55,959 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2020-09-04 16:11:55,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:11:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2020-09-04 16:11:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-04 16:11:55,962 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:55,962 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 16:11:55,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:11:55,962 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:55,963 INFO L82 PathProgramCache]: Analyzing trace with hash -902449205, now seen corresponding path program 1 times [2020-09-04 16:11:55,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:55,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [791861181] [2020-09-04 16:11:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:55,965 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:55,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 16:11:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 16:11:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 16:11:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:56,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [791861181] [2020-09-04 16:11:56,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:56,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:11:56,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350760168] [2020-09-04 16:11:56,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:11:56,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:11:56,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:11:56,121 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 6 states. [2020-09-04 16:11:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:56,273 INFO L93 Difference]: Finished difference Result 342 states and 410 transitions. [2020-09-04 16:11:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:11:56,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-09-04 16:11:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:56,276 INFO L225 Difference]: With dead ends: 342 [2020-09-04 16:11:56,276 INFO L226 Difference]: Without dead ends: 214 [2020-09-04 16:11:56,277 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 16:11:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-09-04 16:11:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 186. [2020-09-04 16:11:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-09-04 16:11:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2020-09-04 16:11:56,297 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 113 [2020-09-04 16:11:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:56,298 INFO L479 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2020-09-04 16:11:56,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:11:56,298 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2020-09-04 16:11:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-04 16:11:56,300 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:56,300 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 16:11:56,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:11:56,301 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:56,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:56,301 INFO L82 PathProgramCache]: Analyzing trace with hash 139965841, now seen corresponding path program 3 times [2020-09-04 16:11:56,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:56,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [800785881] [2020-09-04 16:11:56,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:56,304 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 16:11:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 16:11:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 16:11:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:56,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [800785881] [2020-09-04 16:11:56,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:56,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:11:56,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298123776] [2020-09-04 16:11:56,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:11:56,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:56,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:11:56,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:11:56,438 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 7 states. [2020-09-04 16:11:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:56,596 INFO L93 Difference]: Finished difference Result 375 states and 449 transitions. [2020-09-04 16:11:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:11:56,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2020-09-04 16:11:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:56,599 INFO L225 Difference]: With dead ends: 375 [2020-09-04 16:11:56,599 INFO L226 Difference]: Without dead ends: 240 [2020-09-04 16:11:56,601 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 16:11:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-09-04 16:11:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 196. [2020-09-04 16:11:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-09-04 16:11:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2020-09-04 16:11:56,628 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 118 [2020-09-04 16:11:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:56,629 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-09-04 16:11:56,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:11:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2020-09-04 16:11:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-04 16:11:56,632 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:56,633 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 16:11:56,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:11:56,633 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:56,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:56,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1402676931, now seen corresponding path program 2 times [2020-09-04 16:11:56,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:56,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1169766888] [2020-09-04 16:11:56,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:56,636 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 16:11:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 16:11:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 16:11:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:56,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1169766888] [2020-09-04 16:11:56,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:56,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:11:56,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732625012] [2020-09-04 16:11:56,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:11:56,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:11:56,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:11:56,827 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 7 states. [2020-09-04 16:11:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:56,980 INFO L93 Difference]: Finished difference Result 361 states and 435 transitions. [2020-09-04 16:11:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:11:56,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2020-09-04 16:11:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:56,983 INFO L225 Difference]: With dead ends: 361 [2020-09-04 16:11:56,984 INFO L226 Difference]: Without dead ends: 228 [2020-09-04 16:11:56,985 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 16:11:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-09-04 16:11:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 196. [2020-09-04 16:11:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-09-04 16:11:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2020-09-04 16:11:57,006 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 118 [2020-09-04 16:11:57,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:57,007 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2020-09-04 16:11:57,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:11:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2020-09-04 16:11:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 16:11:57,009 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:57,009 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 16:11:57,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:11:57,010 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:57,010 INFO L82 PathProgramCache]: Analyzing trace with hash -229056103, now seen corresponding path program 4 times [2020-09-04 16:11:57,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:57,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [409102360] [2020-09-04 16:11:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:57,012 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 16:11:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 16:11:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-04 16:11:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:57,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [409102360] [2020-09-04 16:11:57,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:57,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:11:57,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008384093] [2020-09-04 16:11:57,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:11:57,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:57,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:11:57,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:11:57,182 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 8 states. [2020-09-04 16:11:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:57,354 INFO L93 Difference]: Finished difference Result 402 states and 482 transitions. [2020-09-04 16:11:57,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:11:57,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-09-04 16:11:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:57,357 INFO L225 Difference]: With dead ends: 402 [2020-09-04 16:11:57,357 INFO L226 Difference]: Without dead ends: 262 [2020-09-04 16:11:57,359 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 16:11:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-09-04 16:11:57,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 206. [2020-09-04 16:11:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-09-04 16:11:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2020-09-04 16:11:57,389 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 123 [2020-09-04 16:11:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:57,389 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2020-09-04 16:11:57,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:11:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2020-09-04 16:11:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 16:11:57,392 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:57,392 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 16:11:57,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:11:57,393 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1033654987, now seen corresponding path program 3 times [2020-09-04 16:11:57,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:57,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1255757851] [2020-09-04 16:11:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:57,397 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 16:11:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 16:11:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-04 16:11:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:57,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1255757851] [2020-09-04 16:11:57,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:57,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:11:57,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409029660] [2020-09-04 16:11:57,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:11:57,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:11:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:11:57,680 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand 8 states. [2020-09-04 16:11:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:57,873 INFO L93 Difference]: Finished difference Result 380 states and 460 transitions. [2020-09-04 16:11:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:11:57,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-09-04 16:11:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:57,878 INFO L225 Difference]: With dead ends: 380 [2020-09-04 16:11:57,878 INFO L226 Difference]: Without dead ends: 242 [2020-09-04 16:11:57,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:11:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-09-04 16:11:57,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 206. [2020-09-04 16:11:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-09-04 16:11:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2020-09-04 16:11:57,906 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 123 [2020-09-04 16:11:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:57,906 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2020-09-04 16:11:57,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:11:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2020-09-04 16:11:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 16:11:57,908 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:57,909 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 16:11:57,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:11:57,909 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:57,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1138358929, now seen corresponding path program 5 times [2020-09-04 16:11:57,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:57,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1260173150] [2020-09-04 16:11:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:57,913 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:57,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 16:11:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 16:11:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 16:11:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:58,080 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1260173150] [2020-09-04 16:11:58,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:58,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:11:58,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162154978] [2020-09-04 16:11:58,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:11:58,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:58,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:11:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:11:58,083 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand 9 states. [2020-09-04 16:11:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:58,243 INFO L93 Difference]: Finished difference Result 429 states and 515 transitions. [2020-09-04 16:11:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:11:58,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-09-04 16:11:58,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:58,246 INFO L225 Difference]: With dead ends: 429 [2020-09-04 16:11:58,246 INFO L226 Difference]: Without dead ends: 284 [2020-09-04 16:11:58,247 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 16:11:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-09-04 16:11:58,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 216. [2020-09-04 16:11:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-09-04 16:11:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2020-09-04 16:11:58,271 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 128 [2020-09-04 16:11:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:58,271 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2020-09-04 16:11:58,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:11:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2020-09-04 16:11:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 16:11:58,273 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:58,273 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 16:11:58,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:11:58,274 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1893897277, now seen corresponding path program 4 times [2020-09-04 16:11:58,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:58,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1075163508] [2020-09-04 16:11:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:58,276 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 16:11:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 16:11:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 16:11:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:58,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1075163508] [2020-09-04 16:11:58,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:58,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:11:58,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629233174] [2020-09-04 16:11:58,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:11:58,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:58,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:11:58,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:11:58,513 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand 9 states. [2020-09-04 16:11:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:58,764 INFO L93 Difference]: Finished difference Result 399 states and 485 transitions. [2020-09-04 16:11:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:11:58,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-09-04 16:11:58,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:58,767 INFO L225 Difference]: With dead ends: 399 [2020-09-04 16:11:58,767 INFO L226 Difference]: Without dead ends: 256 [2020-09-04 16:11:58,769 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 16:11:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-09-04 16:11:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 216. [2020-09-04 16:11:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-09-04 16:11:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2020-09-04 16:11:58,794 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 128 [2020-09-04 16:11:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:58,794 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2020-09-04 16:11:58,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:11:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2020-09-04 16:11:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-04 16:11:58,796 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:58,797 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 16:11:58,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:11:58,797 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1450818713, now seen corresponding path program 6 times [2020-09-04 16:11:58,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:58,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [865006977] [2020-09-04 16:11:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:58,800 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:11:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 16:11:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 16:11:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:58,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [865006977] [2020-09-04 16:11:58,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:58,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:11:58,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625054518] [2020-09-04 16:11:58,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:11:58,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:58,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:11:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:11:58,981 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand 10 states. [2020-09-04 16:11:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:59,173 INFO L93 Difference]: Finished difference Result 456 states and 548 transitions. [2020-09-04 16:11:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:11:59,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-09-04 16:11:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:59,177 INFO L225 Difference]: With dead ends: 456 [2020-09-04 16:11:59,177 INFO L226 Difference]: Without dead ends: 306 [2020-09-04 16:11:59,179 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 16:11:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-09-04 16:11:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 226. [2020-09-04 16:11:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-09-04 16:11:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 272 transitions. [2020-09-04 16:11:59,209 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 272 transitions. Word has length 133 [2020-09-04 16:11:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:59,209 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 272 transitions. [2020-09-04 16:11:59,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:11:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 272 transitions. [2020-09-04 16:11:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-04 16:11:59,212 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:59,212 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 16:11:59,213 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:11:59,213 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1581437493, now seen corresponding path program 5 times [2020-09-04 16:11:59,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:59,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1240139873] [2020-09-04 16:11:59,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:59,216 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:11:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 16:11:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 16:11:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:11:59,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1240139873] [2020-09-04 16:11:59,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:59,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:11:59,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477037638] [2020-09-04 16:11:59,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:11:59,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:59,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:11:59,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:11:59,489 INFO L87 Difference]: Start difference. First operand 226 states and 272 transitions. Second operand 10 states. [2020-09-04 16:11:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:11:59,695 INFO L93 Difference]: Finished difference Result 418 states and 510 transitions. [2020-09-04 16:11:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:11:59,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-09-04 16:11:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:11:59,699 INFO L225 Difference]: With dead ends: 418 [2020-09-04 16:11:59,699 INFO L226 Difference]: Without dead ends: 270 [2020-09-04 16:11:59,700 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 16:11:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-09-04 16:11:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 226. [2020-09-04 16:11:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-09-04 16:11:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 272 transitions. [2020-09-04 16:11:59,722 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 272 transitions. Word has length 133 [2020-09-04 16:11:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:11:59,722 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 272 transitions. [2020-09-04 16:11:59,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:11:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 272 transitions. [2020-09-04 16:11:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-09-04 16:11:59,725 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:11:59,726 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 16:11:59,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:11:59,726 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:11:59,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:11:59,727 INFO L82 PathProgramCache]: Analyzing trace with hash 688521105, now seen corresponding path program 7 times [2020-09-04 16:11:59,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:11:59,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [771049961] [2020-09-04 16:11:59,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:11:59,731 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:11:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:11:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:11:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:11:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 16:11:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 16:11:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 16:11:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:11:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:11:59,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [771049961] [2020-09-04 16:11:59,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:11:59,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:11:59,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866101265] [2020-09-04 16:11:59,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:11:59,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:11:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:11:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:11:59,935 INFO L87 Difference]: Start difference. First operand 226 states and 272 transitions. Second operand 11 states. [2020-09-04 16:12:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:00,122 INFO L93 Difference]: Finished difference Result 483 states and 581 transitions. [2020-09-04 16:12:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:12:00,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2020-09-04 16:12:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:00,126 INFO L225 Difference]: With dead ends: 483 [2020-09-04 16:12:00,126 INFO L226 Difference]: Without dead ends: 328 [2020-09-04 16:12:00,131 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 16:12:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-09-04 16:12:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 236. [2020-09-04 16:12:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-04 16:12:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2020-09-04 16:12:00,164 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 138 [2020-09-04 16:12:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:00,164 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2020-09-04 16:12:00,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:12:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2020-09-04 16:12:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-09-04 16:12:00,166 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:00,167 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 16:12:00,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:12:00,167 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:00,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:00,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1951232195, now seen corresponding path program 6 times [2020-09-04 16:12:00,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:00,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [377043963] [2020-09-04 16:12:00,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:00,175 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 16:12:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 16:12:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 16:12:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:00,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [377043963] [2020-09-04 16:12:00,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:00,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:12:00,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216196573] [2020-09-04 16:12:00,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:12:00,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:12:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:12:00,561 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 11 states. [2020-09-04 16:12:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:00,879 INFO L93 Difference]: Finished difference Result 437 states and 535 transitions. [2020-09-04 16:12:00,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:12:00,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2020-09-04 16:12:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:00,882 INFO L225 Difference]: With dead ends: 437 [2020-09-04 16:12:00,883 INFO L226 Difference]: Without dead ends: 284 [2020-09-04 16:12:00,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:12:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-09-04 16:12:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2020-09-04 16:12:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-04 16:12:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2020-09-04 16:12:00,910 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 138 [2020-09-04 16:12:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:00,911 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2020-09-04 16:12:00,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:12:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2020-09-04 16:12:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-04 16:12:00,913 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:00,914 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 16:12:00,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:12:00,914 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1216030823, now seen corresponding path program 8 times [2020-09-04 16:12:00,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:00,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1384469392] [2020-09-04 16:12:00,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:00,917 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:00,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 16:12:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-04 16:12:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 16:12:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:01,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1384469392] [2020-09-04 16:12:01,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:01,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:12:01,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785704906] [2020-09-04 16:12:01,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:12:01,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:01,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:12:01,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:12:01,164 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 12 states. [2020-09-04 16:12:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:01,384 INFO L93 Difference]: Finished difference Result 510 states and 614 transitions. [2020-09-04 16:12:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:12:01,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2020-09-04 16:12:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:01,388 INFO L225 Difference]: With dead ends: 510 [2020-09-04 16:12:01,388 INFO L226 Difference]: Without dead ends: 350 [2020-09-04 16:12:01,390 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 16:12:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-09-04 16:12:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 246. [2020-09-04 16:12:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-09-04 16:12:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 298 transitions. [2020-09-04 16:12:01,415 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 298 transitions. Word has length 143 [2020-09-04 16:12:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:01,416 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 298 transitions. [2020-09-04 16:12:01,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:12:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 298 transitions. [2020-09-04 16:12:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-04 16:12:01,418 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:01,419 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 16:12:01,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:12:01,419 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash 46680267, now seen corresponding path program 7 times [2020-09-04 16:12:01,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:01,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [109631335] [2020-09-04 16:12:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:01,422 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 16:12:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-04 16:12:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 16:12:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:01,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [109631335] [2020-09-04 16:12:01,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:01,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:12:01,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391677404] [2020-09-04 16:12:01,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:12:01,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:01,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:12:01,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:12:01,704 INFO L87 Difference]: Start difference. First operand 246 states and 298 transitions. Second operand 12 states. [2020-09-04 16:12:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:02,029 INFO L93 Difference]: Finished difference Result 456 states and 560 transitions. [2020-09-04 16:12:02,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:12:02,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2020-09-04 16:12:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:02,033 INFO L225 Difference]: With dead ends: 456 [2020-09-04 16:12:02,033 INFO L226 Difference]: Without dead ends: 298 [2020-09-04 16:12:02,034 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 16:12:02,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-09-04 16:12:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 246. [2020-09-04 16:12:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-09-04 16:12:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 298 transitions. [2020-09-04 16:12:02,062 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 298 transitions. Word has length 143 [2020-09-04 16:12:02,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:02,063 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 298 transitions. [2020-09-04 16:12:02,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:12:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 298 transitions. [2020-09-04 16:12:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-09-04 16:12:02,066 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:02,066 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 16:12:02,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:12:02,066 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:02,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:02,067 INFO L82 PathProgramCache]: Analyzing trace with hash -910703471, now seen corresponding path program 9 times [2020-09-04 16:12:02,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:02,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1774602968] [2020-09-04 16:12:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:02,069 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-09-04 16:12:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-09-04 16:12:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-04 16:12:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:02,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1774602968] [2020-09-04 16:12:02,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:02,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:12:02,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534306804] [2020-09-04 16:12:02,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:12:02,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:02,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:12:02,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:12:02,347 INFO L87 Difference]: Start difference. First operand 246 states and 298 transitions. Second operand 13 states. [2020-09-04 16:12:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:02,580 INFO L93 Difference]: Finished difference Result 537 states and 647 transitions. [2020-09-04 16:12:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:12:02,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2020-09-04 16:12:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:02,584 INFO L225 Difference]: With dead ends: 537 [2020-09-04 16:12:02,584 INFO L226 Difference]: Without dead ends: 372 [2020-09-04 16:12:02,587 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 16:12:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-09-04 16:12:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 256. [2020-09-04 16:12:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-09-04 16:12:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 311 transitions. [2020-09-04 16:12:02,613 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 311 transitions. Word has length 148 [2020-09-04 16:12:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:02,614 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 311 transitions. [2020-09-04 16:12:02,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:12:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 311 transitions. [2020-09-04 16:12:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-09-04 16:12:02,616 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:02,616 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 16:12:02,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 16:12:02,617 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:02,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash 352007619, now seen corresponding path program 8 times [2020-09-04 16:12:02,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:02,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1461761839] [2020-09-04 16:12:02,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:02,619 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-09-04 16:12:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-09-04 16:12:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-04 16:12:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:02,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1461761839] [2020-09-04 16:12:02,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:02,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:12:02,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626772885] [2020-09-04 16:12:02,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:12:02,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:02,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:12:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:12:02,970 INFO L87 Difference]: Start difference. First operand 256 states and 311 transitions. Second operand 13 states. [2020-09-04 16:12:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:03,382 INFO L93 Difference]: Finished difference Result 475 states and 585 transitions. [2020-09-04 16:12:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:12:03,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2020-09-04 16:12:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:03,385 INFO L225 Difference]: With dead ends: 475 [2020-09-04 16:12:03,386 INFO L226 Difference]: Without dead ends: 312 [2020-09-04 16:12:03,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:12:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-09-04 16:12:03,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 256. [2020-09-04 16:12:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-09-04 16:12:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 311 transitions. [2020-09-04 16:12:03,412 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 311 transitions. Word has length 148 [2020-09-04 16:12:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:03,412 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 311 transitions. [2020-09-04 16:12:03,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:12:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 311 transitions. [2020-09-04 16:12:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 16:12:03,415 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:03,415 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 16:12:03,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 16:12:03,416 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:03,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:03,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1515572583, now seen corresponding path program 10 times [2020-09-04 16:12:03,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:03,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [484026056] [2020-09-04 16:12:03,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:03,419 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 16:12:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 16:12:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 16:12:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:03,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [484026056] [2020-09-04 16:12:03,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:03,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:12:03,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682861785] [2020-09-04 16:12:03,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:12:03,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:12:03,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:12:03,750 INFO L87 Difference]: Start difference. First operand 256 states and 311 transitions. Second operand 14 states. [2020-09-04 16:12:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:04,013 INFO L93 Difference]: Finished difference Result 564 states and 680 transitions. [2020-09-04 16:12:04,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:12:04,014 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2020-09-04 16:12:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:04,018 INFO L225 Difference]: With dead ends: 564 [2020-09-04 16:12:04,018 INFO L226 Difference]: Without dead ends: 394 [2020-09-04 16:12:04,020 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 16:12:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-09-04 16:12:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 266. [2020-09-04 16:12:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-09-04 16:12:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2020-09-04 16:12:04,063 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 153 [2020-09-04 16:12:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:04,063 INFO L479 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2020-09-04 16:12:04,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:12:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2020-09-04 16:12:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 16:12:04,067 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:04,068 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 16:12:04,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 16:12:04,071 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:04,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:04,071 INFO L82 PathProgramCache]: Analyzing trace with hash -252861493, now seen corresponding path program 9 times [2020-09-04 16:12:04,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:04,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379581147] [2020-09-04 16:12:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:04,077 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 16:12:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 16:12:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 16:12:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:04,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379581147] [2020-09-04 16:12:04,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:04,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:12:04,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107685405] [2020-09-04 16:12:04,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:12:04,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:12:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:12:04,511 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand 14 states. [2020-09-04 16:12:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:04,952 INFO L93 Difference]: Finished difference Result 494 states and 610 transitions. [2020-09-04 16:12:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:12:04,952 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2020-09-04 16:12:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:04,955 INFO L225 Difference]: With dead ends: 494 [2020-09-04 16:12:04,955 INFO L226 Difference]: Without dead ends: 326 [2020-09-04 16:12:04,957 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 16:12:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-09-04 16:12:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2020-09-04 16:12:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-09-04 16:12:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2020-09-04 16:12:04,983 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 153 [2020-09-04 16:12:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:04,983 INFO L479 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2020-09-04 16:12:04,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:12:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2020-09-04 16:12:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-04 16:12:04,986 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:04,986 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 16:12:04,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 16:12:04,986 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash 867387793, now seen corresponding path program 11 times [2020-09-04 16:12:04,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:04,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [773975447] [2020-09-04 16:12:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:04,990 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 16:12:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 16:12:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 16:12:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:05,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [773975447] [2020-09-04 16:12:05,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:05,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:12:05,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321071629] [2020-09-04 16:12:05,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:12:05,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:05,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:12:05,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:12:05,336 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand 15 states. [2020-09-04 16:12:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:05,679 INFO L93 Difference]: Finished difference Result 591 states and 713 transitions. [2020-09-04 16:12:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:12:05,680 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2020-09-04 16:12:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:05,683 INFO L225 Difference]: With dead ends: 591 [2020-09-04 16:12:05,684 INFO L226 Difference]: Without dead ends: 416 [2020-09-04 16:12:05,685 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 16:12:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-09-04 16:12:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 276. [2020-09-04 16:12:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-09-04 16:12:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2020-09-04 16:12:05,720 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 158 [2020-09-04 16:12:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:05,721 INFO L479 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2020-09-04 16:12:05,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:12:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2020-09-04 16:12:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-04 16:12:05,723 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:05,723 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 16:12:05,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 16:12:05,724 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:05,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2130098883, now seen corresponding path program 10 times [2020-09-04 16:12:05,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:05,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [438712054] [2020-09-04 16:12:05,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:05,727 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:05,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 16:12:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 16:12:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 16:12:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:06,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [438712054] [2020-09-04 16:12:06,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:06,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:12:06,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522803881] [2020-09-04 16:12:06,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:12:06,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:12:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:12:06,110 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand 15 states. [2020-09-04 16:12:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:06,634 INFO L93 Difference]: Finished difference Result 513 states and 635 transitions. [2020-09-04 16:12:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:12:06,635 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2020-09-04 16:12:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:06,637 INFO L225 Difference]: With dead ends: 513 [2020-09-04 16:12:06,638 INFO L226 Difference]: Without dead ends: 340 [2020-09-04 16:12:06,640 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 16:12:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-09-04 16:12:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 276. [2020-09-04 16:12:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2020-09-04 16:12:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2020-09-04 16:12:06,671 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 158 [2020-09-04 16:12:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:06,671 INFO L479 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2020-09-04 16:12:06,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:12:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2020-09-04 16:12:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-04 16:12:06,676 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:06,677 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 16:12:06,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 16:12:06,677 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:06,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:06,678 INFO L82 PathProgramCache]: Analyzing trace with hash 890883481, now seen corresponding path program 12 times [2020-09-04 16:12:06,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:06,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [901771699] [2020-09-04 16:12:06,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:06,680 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 16:12:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 16:12:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:06,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 16:12:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:07,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [901771699] [2020-09-04 16:12:07,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:07,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:12:07,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077431854] [2020-09-04 16:12:07,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:12:07,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:07,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:12:07,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:12:07,024 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand 16 states. [2020-09-04 16:12:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:07,293 INFO L93 Difference]: Finished difference Result 618 states and 746 transitions. [2020-09-04 16:12:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:12:07,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 163 [2020-09-04 16:12:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:07,297 INFO L225 Difference]: With dead ends: 618 [2020-09-04 16:12:07,297 INFO L226 Difference]: Without dead ends: 438 [2020-09-04 16:12:07,299 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 16:12:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-09-04 16:12:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 286. [2020-09-04 16:12:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-09-04 16:12:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 350 transitions. [2020-09-04 16:12:07,337 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 350 transitions. Word has length 163 [2020-09-04 16:12:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:07,338 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 350 transitions. [2020-09-04 16:12:07,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:12:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 350 transitions. [2020-09-04 16:12:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-04 16:12:07,342 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:07,342 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 16:12:07,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 16:12:07,343 INFO L427 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:07,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:07,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372725, now seen corresponding path program 11 times [2020-09-04 16:12:07,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:07,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1037800580] [2020-09-04 16:12:07,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:07,346 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-09-04 16:12:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 16:12:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 16:12:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:07,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1037800580] [2020-09-04 16:12:07,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:07,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:12:07,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452819829] [2020-09-04 16:12:07,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:12:07,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:07,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:12:07,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:12:07,799 INFO L87 Difference]: Start difference. First operand 286 states and 350 transitions. Second operand 16 states. [2020-09-04 16:12:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:08,373 INFO L93 Difference]: Finished difference Result 532 states and 660 transitions. [2020-09-04 16:12:08,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:12:08,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 163 [2020-09-04 16:12:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:08,376 INFO L225 Difference]: With dead ends: 532 [2020-09-04 16:12:08,377 INFO L226 Difference]: Without dead ends: 354 [2020-09-04 16:12:08,378 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 16:12:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-09-04 16:12:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 286. [2020-09-04 16:12:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-09-04 16:12:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 350 transitions. [2020-09-04 16:12:08,410 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 350 transitions. Word has length 163 [2020-09-04 16:12:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:08,411 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 350 transitions. [2020-09-04 16:12:08,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:12:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 350 transitions. [2020-09-04 16:12:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 16:12:08,413 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:08,414 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 16:12:08,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 16:12:08,414 INFO L427 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:08,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1892454033, now seen corresponding path program 13 times [2020-09-04 16:12:08,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:08,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1495732407] [2020-09-04 16:12:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:08,418 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 16:12:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 16:12:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 16:12:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:08,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1495732407] [2020-09-04 16:12:08,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:08,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:12:08,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083543149] [2020-09-04 16:12:08,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:12:08,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:08,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:12:08,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:12:08,762 INFO L87 Difference]: Start difference. First operand 286 states and 350 transitions. Second operand 17 states. [2020-09-04 16:12:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:09,119 INFO L93 Difference]: Finished difference Result 645 states and 779 transitions. [2020-09-04 16:12:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:12:09,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2020-09-04 16:12:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:09,123 INFO L225 Difference]: With dead ends: 645 [2020-09-04 16:12:09,124 INFO L226 Difference]: Without dead ends: 460 [2020-09-04 16:12:09,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:12:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-09-04 16:12:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 296. [2020-09-04 16:12:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-04 16:12:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2020-09-04 16:12:09,159 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 168 [2020-09-04 16:12:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:09,160 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2020-09-04 16:12:09,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:12:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2020-09-04 16:12:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 16:12:09,162 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:09,163 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 16:12:09,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-04 16:12:09,163 INFO L427 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:09,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1139802173, now seen corresponding path program 12 times [2020-09-04 16:12:09,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:09,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1757513260] [2020-09-04 16:12:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:09,166 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 16:12:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 16:12:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 16:12:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:09,647 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1757513260] [2020-09-04 16:12:09,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:09,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:12:09,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474734417] [2020-09-04 16:12:09,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:12:09,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:09,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:12:09,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:12:09,649 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 17 states. [2020-09-04 16:12:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:10,344 INFO L93 Difference]: Finished difference Result 551 states and 685 transitions. [2020-09-04 16:12:10,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:12:10,345 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2020-09-04 16:12:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:10,348 INFO L225 Difference]: With dead ends: 551 [2020-09-04 16:12:10,349 INFO L226 Difference]: Without dead ends: 368 [2020-09-04 16:12:10,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:12:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2020-09-04 16:12:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 296. [2020-09-04 16:12:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-04 16:12:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2020-09-04 16:12:10,385 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 168 [2020-09-04 16:12:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:10,385 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2020-09-04 16:12:10,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:12:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2020-09-04 16:12:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-09-04 16:12:10,388 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:10,388 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 16:12:10,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-04 16:12:10,389 INFO L427 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash -33314663, now seen corresponding path program 14 times [2020-09-04 16:12:10,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:10,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1962237640] [2020-09-04 16:12:10,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:10,393 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-09-04 16:12:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 16:12:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-09-04 16:12:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:10,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1962237640] [2020-09-04 16:12:10,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:10,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:12:10,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880355841] [2020-09-04 16:12:10,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:12:10,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:10,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:12:10,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:12:10,810 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 18 states. [2020-09-04 16:12:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:11,213 INFO L93 Difference]: Finished difference Result 672 states and 812 transitions. [2020-09-04 16:12:11,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:12:11,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2020-09-04 16:12:11,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:11,219 INFO L225 Difference]: With dead ends: 672 [2020-09-04 16:12:11,219 INFO L226 Difference]: Without dead ends: 482 [2020-09-04 16:12:11,222 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 16:12:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-09-04 16:12:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 306. [2020-09-04 16:12:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-09-04 16:12:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 376 transitions. [2020-09-04 16:12:11,256 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 376 transitions. Word has length 173 [2020-09-04 16:12:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:11,257 INFO L479 AbstractCegarLoop]: Abstraction has 306 states and 376 transitions. [2020-09-04 16:12:11,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:12:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 376 transitions. [2020-09-04 16:12:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-09-04 16:12:11,259 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:11,260 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 16:12:11,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-04 16:12:11,260 INFO L427 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:11,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:11,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1229396427, now seen corresponding path program 13 times [2020-09-04 16:12:11,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:11,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719480251] [2020-09-04 16:12:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:11,264 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-09-04 16:12:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 16:12:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-09-04 16:12:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:11,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719480251] [2020-09-04 16:12:11,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:11,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:12:11,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103097410] [2020-09-04 16:12:11,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:12:11,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:11,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:12:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:12:11,763 INFO L87 Difference]: Start difference. First operand 306 states and 376 transitions. Second operand 18 states. [2020-09-04 16:12:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:12,398 INFO L93 Difference]: Finished difference Result 570 states and 710 transitions. [2020-09-04 16:12:12,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:12:12,401 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2020-09-04 16:12:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:12,403 INFO L225 Difference]: With dead ends: 570 [2020-09-04 16:12:12,404 INFO L226 Difference]: Without dead ends: 382 [2020-09-04 16:12:12,408 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 16:12:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-09-04 16:12:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 306. [2020-09-04 16:12:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-09-04 16:12:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 376 transitions. [2020-09-04 16:12:12,441 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 376 transitions. Word has length 173 [2020-09-04 16:12:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:12,442 INFO L479 AbstractCegarLoop]: Abstraction has 306 states and 376 transitions. [2020-09-04 16:12:12,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:12:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 376 transitions. [2020-09-04 16:12:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-09-04 16:12:12,445 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:12,446 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 16:12:12,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-04 16:12:12,446 INFO L427 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:12,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2032954479, now seen corresponding path program 15 times [2020-09-04 16:12:12,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:12,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [700908747] [2020-09-04 16:12:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:12,449 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 16:12:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 16:12:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-09-04 16:12:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-09-04 16:12:12,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [700908747] [2020-09-04 16:12:12,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:12,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:12:12,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901138917] [2020-09-04 16:12:12,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:12:12,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:12,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:12:12,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:12:12,553 INFO L87 Difference]: Start difference. First operand 306 states and 376 transitions. Second operand 3 states. [2020-09-04 16:12:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:12,584 INFO L93 Difference]: Finished difference Result 321 states and 393 transitions. [2020-09-04 16:12:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:12:12,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-09-04 16:12:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:12,587 INFO L225 Difference]: With dead ends: 321 [2020-09-04 16:12:12,587 INFO L226 Difference]: Without dead ends: 305 [2020-09-04 16:12:12,588 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 16:12:12,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-09-04 16:12:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2020-09-04 16:12:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-09-04 16:12:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 374 transitions. [2020-09-04 16:12:12,627 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 374 transitions. Word has length 178 [2020-09-04 16:12:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:12,627 INFO L479 AbstractCegarLoop]: Abstraction has 305 states and 374 transitions. [2020-09-04 16:12:12,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:12:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2020-09-04 16:12:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 16:12:12,630 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:12,631 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 16:12:12,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-04 16:12:12,631 INFO L427 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash 368593816, now seen corresponding path program 1 times [2020-09-04 16:12:12,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:12,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798983245] [2020-09-04 16:12:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:12,635 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 16:12:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 16:12:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 16:12:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-09-04 16:12:12,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798983245] [2020-09-04 16:12:12,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:12,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 16:12:12,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409686197] [2020-09-04 16:12:12,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 16:12:12,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:12,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 16:12:12,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 16:12:12,768 INFO L87 Difference]: Start difference. First operand 305 states and 374 transitions. Second operand 4 states. [2020-09-04 16:12:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:12,821 INFO L93 Difference]: Finished difference Result 321 states and 392 transitions. [2020-09-04 16:12:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 16:12:12,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2020-09-04 16:12:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:12,828 INFO L225 Difference]: With dead ends: 321 [2020-09-04 16:12:12,828 INFO L226 Difference]: Without dead ends: 304 [2020-09-04 16:12:12,829 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 16:12:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-09-04 16:12:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-09-04 16:12:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-09-04 16:12:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 372 transitions. [2020-09-04 16:12:12,874 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 372 transitions. Word has length 180 [2020-09-04 16:12:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:12,875 INFO L479 AbstractCegarLoop]: Abstraction has 304 states and 372 transitions. [2020-09-04 16:12:12,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 16:12:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 372 transitions. [2020-09-04 16:12:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 16:12:12,879 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:12,880 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 16:12:12,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-09-04 16:12:12,880 INFO L427 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1683689272, now seen corresponding path program 1 times [2020-09-04 16:12:12,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:12,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [952775107] [2020-09-04 16:12:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:12,895 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:12,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 16:12:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 16:12:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 16:12:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:13,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [952775107] [2020-09-04 16:12:13,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:13,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:12:13,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240147764] [2020-09-04 16:12:13,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:12:13,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:13,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:12:13,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:12:13,326 INFO L87 Difference]: Start difference. First operand 304 states and 372 transitions. Second operand 19 states. [2020-09-04 16:12:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:13,702 INFO L93 Difference]: Finished difference Result 695 states and 837 transitions. [2020-09-04 16:12:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:12:13,703 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2020-09-04 16:12:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:13,706 INFO L225 Difference]: With dead ends: 695 [2020-09-04 16:12:13,706 INFO L226 Difference]: Without dead ends: 502 [2020-09-04 16:12:13,707 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 16:12:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-09-04 16:12:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 314. [2020-09-04 16:12:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-09-04 16:12:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2020-09-04 16:12:13,742 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 180 [2020-09-04 16:12:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:13,743 INFO L479 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2020-09-04 16:12:13,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:12:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2020-09-04 16:12:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 16:12:13,745 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:13,745 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 16:12:13,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-09-04 16:12:13,746 INFO L427 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash -326698006, now seen corresponding path program 1 times [2020-09-04 16:12:13,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:13,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1228976052] [2020-09-04 16:12:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:13,749 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:13,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-09-04 16:12:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-09-04 16:12:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 16:12:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:14,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1228976052] [2020-09-04 16:12:14,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:14,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:12:14,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191284975] [2020-09-04 16:12:14,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:12:14,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:14,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:12:14,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:12:14,309 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 19 states. [2020-09-04 16:12:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:15,030 INFO L93 Difference]: Finished difference Result 585 states and 727 transitions. [2020-09-04 16:12:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:12:15,038 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2020-09-04 16:12:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:15,041 INFO L225 Difference]: With dead ends: 585 [2020-09-04 16:12:15,041 INFO L226 Difference]: Without dead ends: 394 [2020-09-04 16:12:15,043 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 16:12:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-09-04 16:12:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 314. [2020-09-04 16:12:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-09-04 16:12:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2020-09-04 16:12:15,083 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 180 [2020-09-04 16:12:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:15,083 INFO L479 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2020-09-04 16:12:15,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:12:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2020-09-04 16:12:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-09-04 16:12:15,085 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:15,086 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 16:12:15,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-09-04 16:12:15,086 INFO L427 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1714201280, now seen corresponding path program 2 times [2020-09-04 16:12:15,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:15,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [471570518] [2020-09-04 16:12:15,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:15,093 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 16:12:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2020-09-04 16:12:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 16:12:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:15,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [471570518] [2020-09-04 16:12:15,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:15,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:12:15,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730913785] [2020-09-04 16:12:15,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:12:15,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:15,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:12:15,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:12:15,591 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 20 states. [2020-09-04 16:12:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:16,030 INFO L93 Difference]: Finished difference Result 722 states and 870 transitions. [2020-09-04 16:12:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:12:16,032 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 185 [2020-09-04 16:12:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:16,035 INFO L225 Difference]: With dead ends: 722 [2020-09-04 16:12:16,036 INFO L226 Difference]: Without dead ends: 524 [2020-09-04 16:12:16,037 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 16:12:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-09-04 16:12:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 324. [2020-09-04 16:12:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-09-04 16:12:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 398 transitions. [2020-09-04 16:12:16,076 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 398 transitions. Word has length 185 [2020-09-04 16:12:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:16,077 INFO L479 AbstractCegarLoop]: Abstraction has 324 states and 398 transitions. [2020-09-04 16:12:16,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:12:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 398 transitions. [2020-09-04 16:12:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-09-04 16:12:16,079 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:16,079 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 16:12:16,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-09-04 16:12:16,079 INFO L427 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:16,080 INFO L82 PathProgramCache]: Analyzing trace with hash 570378738, now seen corresponding path program 2 times [2020-09-04 16:12:16,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:16,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [569322301] [2020-09-04 16:12:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:16,081 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 16:12:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2020-09-04 16:12:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 16:12:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:16,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [569322301] [2020-09-04 16:12:16,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:16,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:12:16,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864533060] [2020-09-04 16:12:16,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:12:16,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:16,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:12:16,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:12:16,729 INFO L87 Difference]: Start difference. First operand 324 states and 398 transitions. Second operand 20 states. [2020-09-04 16:12:17,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:17,705 INFO L93 Difference]: Finished difference Result 604 states and 752 transitions. [2020-09-04 16:12:17,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:12:17,706 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 185 [2020-09-04 16:12:17,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:17,708 INFO L225 Difference]: With dead ends: 604 [2020-09-04 16:12:17,708 INFO L226 Difference]: Without dead ends: 408 [2020-09-04 16:12:17,709 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 16:12:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2020-09-04 16:12:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 324. [2020-09-04 16:12:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-09-04 16:12:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 398 transitions. [2020-09-04 16:12:17,745 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 398 transitions. Word has length 185 [2020-09-04 16:12:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:17,746 INFO L479 AbstractCegarLoop]: Abstraction has 324 states and 398 transitions. [2020-09-04 16:12:17,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:12:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 398 transitions. [2020-09-04 16:12:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-09-04 16:12:17,748 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:17,748 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 16:12:17,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-09-04 16:12:17,748 INFO L427 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:17,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:17,749 INFO L82 PathProgramCache]: Analyzing trace with hash 922915896, now seen corresponding path program 3 times [2020-09-04 16:12:17,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:17,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1352484915] [2020-09-04 16:12:17,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:17,750 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:17,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:17,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:17,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-09-04 16:12:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-04 16:12:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-04 16:12:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:18,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1352484915] [2020-09-04 16:12:18,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:18,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:12:18,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349844039] [2020-09-04 16:12:18,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:12:18,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:18,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:12:18,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:12:18,248 INFO L87 Difference]: Start difference. First operand 324 states and 398 transitions. Second operand 21 states. [2020-09-04 16:12:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:18,743 INFO L93 Difference]: Finished difference Result 749 states and 903 transitions. [2020-09-04 16:12:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:12:18,749 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 190 [2020-09-04 16:12:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:18,752 INFO L225 Difference]: With dead ends: 749 [2020-09-04 16:12:18,752 INFO L226 Difference]: Without dead ends: 546 [2020-09-04 16:12:18,754 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 16:12:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-09-04 16:12:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 334. [2020-09-04 16:12:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-09-04 16:12:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 411 transitions. [2020-09-04 16:12:18,791 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 411 transitions. Word has length 190 [2020-09-04 16:12:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:18,792 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 411 transitions. [2020-09-04 16:12:18,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:12:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 411 transitions. [2020-09-04 16:12:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-09-04 16:12:18,794 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:18,794 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 16:12:18,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-09-04 16:12:18,794 INFO L427 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1087471382, now seen corresponding path program 3 times [2020-09-04 16:12:18,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:18,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660954990] [2020-09-04 16:12:18,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:18,797 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-09-04 16:12:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-04 16:12:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-04 16:12:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:19,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660954990] [2020-09-04 16:12:19,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:19,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:12:19,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499639139] [2020-09-04 16:12:19,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:12:19,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:19,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:12:19,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:12:19,458 INFO L87 Difference]: Start difference. First operand 334 states and 411 transitions. Second operand 21 states. [2020-09-04 16:12:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:20,533 INFO L93 Difference]: Finished difference Result 623 states and 777 transitions. [2020-09-04 16:12:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:12:20,537 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 190 [2020-09-04 16:12:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:20,540 INFO L225 Difference]: With dead ends: 623 [2020-09-04 16:12:20,540 INFO L226 Difference]: Without dead ends: 422 [2020-09-04 16:12:20,541 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 16:12:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-09-04 16:12:20,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 334. [2020-09-04 16:12:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-09-04 16:12:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 411 transitions. [2020-09-04 16:12:20,595 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 411 transitions. Word has length 190 [2020-09-04 16:12:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:20,596 INFO L479 AbstractCegarLoop]: Abstraction has 334 states and 411 transitions. [2020-09-04 16:12:20,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:12:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 411 transitions. [2020-09-04 16:12:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 16:12:20,598 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:20,598 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 16:12:20,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-09-04 16:12:20,599 INFO L427 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:20,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:20,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1276573760, now seen corresponding path program 4 times [2020-09-04 16:12:20,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:20,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [904802095] [2020-09-04 16:12:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:20,602 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 16:12:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 16:12:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 16:12:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:21,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [904802095] [2020-09-04 16:12:21,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:21,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:12:21,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523464861] [2020-09-04 16:12:21,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:12:21,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:12:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:12:21,151 INFO L87 Difference]: Start difference. First operand 334 states and 411 transitions. Second operand 22 states. [2020-09-04 16:12:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:21,530 INFO L93 Difference]: Finished difference Result 776 states and 936 transitions. [2020-09-04 16:12:21,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:12:21,531 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 195 [2020-09-04 16:12:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:21,534 INFO L225 Difference]: With dead ends: 776 [2020-09-04 16:12:21,535 INFO L226 Difference]: Without dead ends: 568 [2020-09-04 16:12:21,536 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 16:12:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-09-04 16:12:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 344. [2020-09-04 16:12:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-09-04 16:12:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 424 transitions. [2020-09-04 16:12:21,576 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 424 transitions. Word has length 195 [2020-09-04 16:12:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:21,576 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 424 transitions. [2020-09-04 16:12:21,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:12:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 424 transitions. [2020-09-04 16:12:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 16:12:21,578 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:21,579 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 16:12:21,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-09-04 16:12:21,579 INFO L427 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:21,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:21,579 INFO L82 PathProgramCache]: Analyzing trace with hash -733813518, now seen corresponding path program 4 times [2020-09-04 16:12:21,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:21,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1652801215] [2020-09-04 16:12:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:21,581 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 16:12:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 16:12:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 16:12:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:22,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1652801215] [2020-09-04 16:12:22,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:22,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:12:22,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410822011] [2020-09-04 16:12:22,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:12:22,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:22,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:12:22,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:12:22,307 INFO L87 Difference]: Start difference. First operand 344 states and 424 transitions. Second operand 22 states. [2020-09-04 16:12:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:23,545 INFO L93 Difference]: Finished difference Result 642 states and 802 transitions. [2020-09-04 16:12:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:12:23,546 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 195 [2020-09-04 16:12:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:23,551 INFO L225 Difference]: With dead ends: 642 [2020-09-04 16:12:23,551 INFO L226 Difference]: Without dead ends: 436 [2020-09-04 16:12:23,553 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 16:12:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-09-04 16:12:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 344. [2020-09-04 16:12:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-09-04 16:12:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 424 transitions. [2020-09-04 16:12:23,613 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 424 transitions. Word has length 195 [2020-09-04 16:12:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:23,614 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 424 transitions. [2020-09-04 16:12:23,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:12:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 424 transitions. [2020-09-04 16:12:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 16:12:23,617 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:23,617 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 16:12:23,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-09-04 16:12:23,618 INFO L427 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:23,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:23,619 INFO L82 PathProgramCache]: Analyzing trace with hash -171452104, now seen corresponding path program 5 times [2020-09-04 16:12:23,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:23,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987061901] [2020-09-04 16:12:23,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:23,621 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:23,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 16:12:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2020-09-04 16:12:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 16:12:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:24,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987061901] [2020-09-04 16:12:24,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:24,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:12:24,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625597025] [2020-09-04 16:12:24,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:12:24,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:24,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:12:24,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:12:24,225 INFO L87 Difference]: Start difference. First operand 344 states and 424 transitions. Second operand 23 states. [2020-09-04 16:12:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:24,780 INFO L93 Difference]: Finished difference Result 803 states and 969 transitions. [2020-09-04 16:12:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:12:24,781 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 200 [2020-09-04 16:12:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:24,784 INFO L225 Difference]: With dead ends: 803 [2020-09-04 16:12:24,785 INFO L226 Difference]: Without dead ends: 590 [2020-09-04 16:12:24,786 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 16:12:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-09-04 16:12:24,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 354. [2020-09-04 16:12:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-09-04 16:12:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2020-09-04 16:12:24,830 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 200 [2020-09-04 16:12:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:24,831 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2020-09-04 16:12:24,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:12:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2020-09-04 16:12:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-09-04 16:12:24,833 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:24,833 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 16:12:24,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-09-04 16:12:24,833 INFO L427 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:24,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2113127914, now seen corresponding path program 5 times [2020-09-04 16:12:24,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:24,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [400298164] [2020-09-04 16:12:24,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:24,836 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:24,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:25,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 16:12:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:25,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2020-09-04 16:12:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:25,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 16:12:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:25,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [400298164] [2020-09-04 16:12:25,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:25,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:12:25,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709967791] [2020-09-04 16:12:25,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:12:25,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:12:25,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:12:25,571 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand 23 states. [2020-09-04 16:12:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:26,848 INFO L93 Difference]: Finished difference Result 661 states and 827 transitions. [2020-09-04 16:12:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:12:26,849 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 200 [2020-09-04 16:12:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:26,852 INFO L225 Difference]: With dead ends: 661 [2020-09-04 16:12:26,852 INFO L226 Difference]: Without dead ends: 450 [2020-09-04 16:12:26,853 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:12:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-09-04 16:12:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 354. [2020-09-04 16:12:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-09-04 16:12:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2020-09-04 16:12:26,899 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 200 [2020-09-04 16:12:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:26,900 INFO L479 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2020-09-04 16:12:26,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:12:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2020-09-04 16:12:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-04 16:12:26,904 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:26,904 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 16:12:26,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-09-04 16:12:26,905 INFO L427 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1093348544, now seen corresponding path program 6 times [2020-09-04 16:12:26,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:26,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [608406039] [2020-09-04 16:12:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:26,907 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:26,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:26,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:26,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 16:12:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 16:12:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-09-04 16:12:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:27,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [608406039] [2020-09-04 16:12:27,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:27,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:12:27,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234996621] [2020-09-04 16:12:27,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:12:27,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:27,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:12:27,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:12:27,512 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand 24 states. [2020-09-04 16:12:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:28,088 INFO L93 Difference]: Finished difference Result 830 states and 1002 transitions. [2020-09-04 16:12:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 16:12:28,088 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 205 [2020-09-04 16:12:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:28,091 INFO L225 Difference]: With dead ends: 830 [2020-09-04 16:12:28,091 INFO L226 Difference]: Without dead ends: 612 [2020-09-04 16:12:28,094 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 16:12:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-09-04 16:12:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 364. [2020-09-04 16:12:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-09-04 16:12:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 450 transitions. [2020-09-04 16:12:28,139 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 450 transitions. Word has length 205 [2020-09-04 16:12:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:28,140 INFO L479 AbstractCegarLoop]: Abstraction has 364 states and 450 transitions. [2020-09-04 16:12:28,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:12:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 450 transitions. [2020-09-04 16:12:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-04 16:12:28,145 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:28,145 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 16:12:28,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-09-04 16:12:28,146 INFO L427 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:28,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:28,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1191231474, now seen corresponding path program 6 times [2020-09-04 16:12:28,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:28,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1771102792] [2020-09-04 16:12:28,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:28,149 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 16:12:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 16:12:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-09-04 16:12:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:28,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1771102792] [2020-09-04 16:12:28,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:28,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:12:28,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097751099] [2020-09-04 16:12:28,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:12:28,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:28,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:12:28,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:12:28,973 INFO L87 Difference]: Start difference. First operand 364 states and 450 transitions. Second operand 24 states. [2020-09-04 16:12:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:30,326 INFO L93 Difference]: Finished difference Result 680 states and 852 transitions. [2020-09-04 16:12:30,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 16:12:30,327 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 205 [2020-09-04 16:12:30,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:30,329 INFO L225 Difference]: With dead ends: 680 [2020-09-04 16:12:30,330 INFO L226 Difference]: Without dead ends: 464 [2020-09-04 16:12:30,331 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 16:12:30,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-09-04 16:12:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 364. [2020-09-04 16:12:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-09-04 16:12:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 450 transitions. [2020-09-04 16:12:30,395 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 450 transitions. Word has length 205 [2020-09-04 16:12:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:30,396 INFO L479 AbstractCegarLoop]: Abstraction has 364 states and 450 transitions. [2020-09-04 16:12:30,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:12:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 450 transitions. [2020-09-04 16:12:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-04 16:12:30,398 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:30,398 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 16:12:30,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-09-04 16:12:30,398 INFO L427 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1719328312, now seen corresponding path program 7 times [2020-09-04 16:12:30,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:30,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1993043384] [2020-09-04 16:12:30,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:30,402 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-09-04 16:12:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-09-04 16:12:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:30,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-09-04 16:12:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:31,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1993043384] [2020-09-04 16:12:31,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:31,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 16:12:31,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94970089] [2020-09-04 16:12:31,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 16:12:31,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:31,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 16:12:31,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:12:31,052 INFO L87 Difference]: Start difference. First operand 364 states and 450 transitions. Second operand 25 states. [2020-09-04 16:12:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:31,572 INFO L93 Difference]: Finished difference Result 857 states and 1035 transitions. [2020-09-04 16:12:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:12:31,573 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 210 [2020-09-04 16:12:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:31,576 INFO L225 Difference]: With dead ends: 857 [2020-09-04 16:12:31,577 INFO L226 Difference]: Without dead ends: 634 [2020-09-04 16:12:31,578 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 16:12:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-09-04 16:12:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 374. [2020-09-04 16:12:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-09-04 16:12:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 463 transitions. [2020-09-04 16:12:31,625 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 463 transitions. Word has length 210 [2020-09-04 16:12:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:31,626 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 463 transitions. [2020-09-04 16:12:31,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 16:12:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 463 transitions. [2020-09-04 16:12:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-04 16:12:31,628 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:31,628 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 16:12:31,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-09-04 16:12:31,629 INFO L427 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash -291058966, now seen corresponding path program 7 times [2020-09-04 16:12:31,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:31,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198364261] [2020-09-04 16:12:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:31,631 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:31,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:31,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:31,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:32,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-09-04 16:12:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:32,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-09-04 16:12:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:32,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2020-09-04 16:12:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:32,517 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:32,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198364261] [2020-09-04 16:12:32,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:32,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 16:12:32,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123363847] [2020-09-04 16:12:32,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 16:12:32,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:32,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 16:12:32,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:12:32,519 INFO L87 Difference]: Start difference. First operand 374 states and 463 transitions. Second operand 25 states. [2020-09-04 16:12:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:33,939 INFO L93 Difference]: Finished difference Result 699 states and 877 transitions. [2020-09-04 16:12:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:12:33,941 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 210 [2020-09-04 16:12:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:33,943 INFO L225 Difference]: With dead ends: 699 [2020-09-04 16:12:33,943 INFO L226 Difference]: Without dead ends: 478 [2020-09-04 16:12:33,945 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 16:12:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-09-04 16:12:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 374. [2020-09-04 16:12:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-09-04 16:12:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 463 transitions. [2020-09-04 16:12:33,992 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 463 transitions. Word has length 210 [2020-09-04 16:12:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:33,993 INFO L479 AbstractCegarLoop]: Abstraction has 374 states and 463 transitions. [2020-09-04 16:12:33,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 16:12:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 463 transitions. [2020-09-04 16:12:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-09-04 16:12:33,995 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:33,996 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 16:12:33,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-09-04 16:12:33,996 INFO L427 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:33,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1312616000, now seen corresponding path program 8 times [2020-09-04 16:12:33,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:33,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1988584020] [2020-09-04 16:12:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:33,999 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 16:12:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 16:12:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2020-09-04 16:12:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:34,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1988584020] [2020-09-04 16:12:34,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:34,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-09-04 16:12:34,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451441318] [2020-09-04 16:12:34,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 16:12:34,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:34,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 16:12:34,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:12:34,755 INFO L87 Difference]: Start difference. First operand 374 states and 463 transitions. Second operand 26 states. [2020-09-04 16:12:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:35,290 INFO L93 Difference]: Finished difference Result 884 states and 1068 transitions. [2020-09-04 16:12:35,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:12:35,290 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2020-09-04 16:12:35,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:35,295 INFO L225 Difference]: With dead ends: 884 [2020-09-04 16:12:35,295 INFO L226 Difference]: Without dead ends: 656 [2020-09-04 16:12:35,297 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 16:12:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-09-04 16:12:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 384. [2020-09-04 16:12:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-09-04 16:12:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2020-09-04 16:12:35,345 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 215 [2020-09-04 16:12:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:35,345 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2020-09-04 16:12:35,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 16:12:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2020-09-04 16:12:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-09-04 16:12:35,347 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:35,348 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 16:12:35,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-09-04 16:12:35,348 INFO L427 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash -697771278, now seen corresponding path program 8 times [2020-09-04 16:12:35,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:35,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113782203] [2020-09-04 16:12:35,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:35,350 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:35,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:35,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:35,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:36,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-09-04 16:12:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:36,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 16:12:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:36,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2020-09-04 16:12:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:36,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2113782203] [2020-09-04 16:12:36,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:36,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-09-04 16:12:36,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181138404] [2020-09-04 16:12:36,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 16:12:36,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:36,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 16:12:36,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:12:36,396 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand 26 states. [2020-09-04 16:12:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:38,037 INFO L93 Difference]: Finished difference Result 718 states and 902 transitions. [2020-09-04 16:12:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:12:38,038 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2020-09-04 16:12:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:38,040 INFO L225 Difference]: With dead ends: 718 [2020-09-04 16:12:38,040 INFO L226 Difference]: Without dead ends: 492 [2020-09-04 16:12:38,042 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2020-09-04 16:12:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-09-04 16:12:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 384. [2020-09-04 16:12:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-09-04 16:12:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2020-09-04 16:12:38,089 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 215 [2020-09-04 16:12:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:38,089 INFO L479 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2020-09-04 16:12:38,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 16:12:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2020-09-04 16:12:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-04 16:12:38,091 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:38,091 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 16:12:38,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-09-04 16:12:38,092 INFO L427 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:38,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:38,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1256956728, now seen corresponding path program 9 times [2020-09-04 16:12:38,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:38,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [308614099] [2020-09-04 16:12:38,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:38,094 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-09-04 16:12:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-09-04 16:12:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-09-04 16:12:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:38,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [308614099] [2020-09-04 16:12:38,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:38,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-09-04 16:12:38,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801192487] [2020-09-04 16:12:38,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 16:12:38,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:38,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 16:12:38,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2020-09-04 16:12:38,874 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand 27 states. [2020-09-04 16:12:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:39,551 INFO L93 Difference]: Finished difference Result 911 states and 1101 transitions. [2020-09-04 16:12:39,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 16:12:39,552 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2020-09-04 16:12:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:39,555 INFO L225 Difference]: With dead ends: 911 [2020-09-04 16:12:39,555 INFO L226 Difference]: Without dead ends: 678 [2020-09-04 16:12:39,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:12:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-09-04 16:12:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 394. [2020-09-04 16:12:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-09-04 16:12:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2020-09-04 16:12:39,604 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 220 [2020-09-04 16:12:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:39,604 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2020-09-04 16:12:39,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 16:12:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2020-09-04 16:12:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-04 16:12:39,606 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:39,607 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 16:12:39,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-09-04 16:12:39,607 INFO L427 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:39,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash -753430550, now seen corresponding path program 9 times [2020-09-04 16:12:39,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:39,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064242022] [2020-09-04 16:12:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:39,609 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:39,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:39,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:39,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-09-04 16:12:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-09-04 16:12:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-09-04 16:12:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:40,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064242022] [2020-09-04 16:12:40,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:40,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-09-04 16:12:40,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514716711] [2020-09-04 16:12:40,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 16:12:40,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:40,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 16:12:40,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2020-09-04 16:12:40,591 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 27 states. [2020-09-04 16:12:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:42,460 INFO L93 Difference]: Finished difference Result 737 states and 927 transitions. [2020-09-04 16:12:42,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 16:12:42,460 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2020-09-04 16:12:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:42,462 INFO L225 Difference]: With dead ends: 737 [2020-09-04 16:12:42,463 INFO L226 Difference]: Without dead ends: 506 [2020-09-04 16:12:42,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:12:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-09-04 16:12:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 394. [2020-09-04 16:12:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-09-04 16:12:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2020-09-04 16:12:42,515 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 220 [2020-09-04 16:12:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:42,515 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2020-09-04 16:12:42,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 16:12:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2020-09-04 16:12:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 16:12:42,516 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:42,517 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 16:12:42,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-09-04 16:12:42,517 INFO L427 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:42,518 INFO L82 PathProgramCache]: Analyzing trace with hash -629192384, now seen corresponding path program 10 times [2020-09-04 16:12:42,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:42,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465028989] [2020-09-04 16:12:42,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:42,521 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:42,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 16:12:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:43,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465028989] [2020-09-04 16:12:43,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:43,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-09-04 16:12:43,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701037474] [2020-09-04 16:12:43,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 16:12:43,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:43,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 16:12:43,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:12:43,272 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 28 states. [2020-09-04 16:12:43,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:43,980 INFO L93 Difference]: Finished difference Result 938 states and 1134 transitions. [2020-09-04 16:12:43,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 16:12:43,981 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-09-04 16:12:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:43,985 INFO L225 Difference]: With dead ends: 938 [2020-09-04 16:12:43,985 INFO L226 Difference]: Without dead ends: 700 [2020-09-04 16:12:43,986 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 16:12:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2020-09-04 16:12:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 404. [2020-09-04 16:12:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-09-04 16:12:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 502 transitions. [2020-09-04 16:12:44,033 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 502 transitions. Word has length 225 [2020-09-04 16:12:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:44,033 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 502 transitions. [2020-09-04 16:12:44,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 16:12:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 502 transitions. [2020-09-04 16:12:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 16:12:44,035 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:44,035 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 16:12:44,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-09-04 16:12:44,036 INFO L427 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:44,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1655387634, now seen corresponding path program 10 times [2020-09-04 16:12:44,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:44,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [125104524] [2020-09-04 16:12:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:44,038 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 16:12:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:44,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [125104524] [2020-09-04 16:12:44,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:44,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:12:44,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379182036] [2020-09-04 16:12:44,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:12:44,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:44,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:12:44,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:12:44,394 INFO L87 Difference]: Start difference. First operand 404 states and 502 transitions. Second operand 10 states. [2020-09-04 16:12:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:44,721 INFO L93 Difference]: Finished difference Result 459 states and 581 transitions. [2020-09-04 16:12:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:12:44,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 225 [2020-09-04 16:12:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:44,726 INFO L225 Difference]: With dead ends: 459 [2020-09-04 16:12:44,726 INFO L226 Difference]: Without dead ends: 453 [2020-09-04 16:12:44,727 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 16:12:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2020-09-04 16:12:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 430. [2020-09-04 16:12:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-09-04 16:12:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 540 transitions. [2020-09-04 16:12:44,808 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 540 transitions. Word has length 225 [2020-09-04 16:12:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:44,809 INFO L479 AbstractCegarLoop]: Abstraction has 430 states and 540 transitions. [2020-09-04 16:12:44,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:12:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 540 transitions. [2020-09-04 16:12:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-09-04 16:12:44,811 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:44,812 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 16:12:44,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-09-04 16:12:44,812 INFO L427 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:44,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:44,812 INFO L82 PathProgramCache]: Analyzing trace with hash -131719239, now seen corresponding path program 1 times [2020-09-04 16:12:44,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:44,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [107552454] [2020-09-04 16:12:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:44,814 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:44,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 16:12:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:12:45,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [107552454] [2020-09-04 16:12:45,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:45,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:12:45,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067991018] [2020-09-04 16:12:45,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:12:45,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:45,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:12:45,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:12:45,168 INFO L87 Difference]: Start difference. First operand 430 states and 540 transitions. Second operand 12 states. [2020-09-04 16:12:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:45,529 INFO L93 Difference]: Finished difference Result 459 states and 579 transitions. [2020-09-04 16:12:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:12:45,530 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 227 [2020-09-04 16:12:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:45,533 INFO L225 Difference]: With dead ends: 459 [2020-09-04 16:12:45,533 INFO L226 Difference]: Without dead ends: 452 [2020-09-04 16:12:45,534 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 16:12:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-09-04 16:12:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 438. [2020-09-04 16:12:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-09-04 16:12:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 549 transitions. [2020-09-04 16:12:45,607 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 549 transitions. Word has length 227 [2020-09-04 16:12:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:45,607 INFO L479 AbstractCegarLoop]: Abstraction has 438 states and 549 transitions. [2020-09-04 16:12:45,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:12:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 549 transitions. [2020-09-04 16:12:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-09-04 16:12:45,610 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:45,610 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 16:12:45,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-09-04 16:12:45,610 INFO L427 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:45,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1678288039, now seen corresponding path program 1 times [2020-09-04 16:12:45,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:45,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1097161082] [2020-09-04 16:12:45,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:45,612 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 16:12:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-09-04 16:12:45,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1097161082] [2020-09-04 16:12:45,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:45,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:12:45,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716665701] [2020-09-04 16:12:45,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:12:45,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:45,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:12:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:12:45,818 INFO L87 Difference]: Start difference. First operand 438 states and 549 transitions. Second operand 6 states. [2020-09-04 16:12:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:45,971 INFO L93 Difference]: Finished difference Result 444 states and 554 transitions. [2020-09-04 16:12:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:12:45,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2020-09-04 16:12:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:45,975 INFO L225 Difference]: With dead ends: 444 [2020-09-04 16:12:45,975 INFO L226 Difference]: Without dead ends: 432 [2020-09-04 16:12:45,976 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 16:12:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-09-04 16:12:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-09-04 16:12:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-09-04 16:12:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 541 transitions. [2020-09-04 16:12:46,088 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 541 transitions. Word has length 227 [2020-09-04 16:12:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:46,089 INFO L479 AbstractCegarLoop]: Abstraction has 432 states and 541 transitions. [2020-09-04 16:12:46,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:12:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 541 transitions. [2020-09-04 16:12:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-09-04 16:12:46,091 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:46,092 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 16:12:46,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-09-04 16:12:46,092 INFO L427 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:46,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash 947853182, now seen corresponding path program 1 times [2020-09-04 16:12:46,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:46,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [564774323] [2020-09-04 16:12:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:46,095 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 16:12:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-09-04 16:12:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 16:12:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 16:12:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 16:12:46,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [564774323] [2020-09-04 16:12:46,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:46,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:12:46,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791994487] [2020-09-04 16:12:46,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:12:46,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:12:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:12:46,415 INFO L87 Difference]: Start difference. First operand 432 states and 541 transitions. Second operand 5 states. [2020-09-04 16:12:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:46,649 INFO L93 Difference]: Finished difference Result 691 states and 868 transitions. [2020-09-04 16:12:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:12:46,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2020-09-04 16:12:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:46,653 INFO L225 Difference]: With dead ends: 691 [2020-09-04 16:12:46,653 INFO L226 Difference]: Without dead ends: 280 [2020-09-04 16:12:46,656 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 16:12:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-09-04 16:12:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2020-09-04 16:12:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-09-04 16:12:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 327 transitions. [2020-09-04 16:12:46,703 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 327 transitions. Word has length 230 [2020-09-04 16:12:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:46,703 INFO L479 AbstractCegarLoop]: Abstraction has 263 states and 327 transitions. [2020-09-04 16:12:46,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:12:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 327 transitions. [2020-09-04 16:12:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-09-04 16:12:46,705 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:12:46,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-09-04 16:12:46,706 INFO L427 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:46,706 INFO L82 PathProgramCache]: Analyzing trace with hash -671277925, now seen corresponding path program 1 times [2020-09-04 16:12:46,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:46,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1808704517] [2020-09-04 16:12:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:46,722 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 16:12:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 16:12:46,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1808704517] [2020-09-04 16:12:46,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:46,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:12:46,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120206979] [2020-09-04 16:12:46,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:12:46,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:46,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:12:46,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:12:46,976 INFO L87 Difference]: Start difference. First operand 263 states and 327 transitions. Second operand 8 states. [2020-09-04 16:12:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:47,138 INFO L93 Difference]: Finished difference Result 317 states and 389 transitions. [2020-09-04 16:12:47,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:12:47,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2020-09-04 16:12:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:47,141 INFO L225 Difference]: With dead ends: 317 [2020-09-04 16:12:47,141 INFO L226 Difference]: Without dead ends: 298 [2020-09-04 16:12:47,141 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 16:12:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-09-04 16:12:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 269. [2020-09-04 16:12:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-09-04 16:12:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2020-09-04 16:12:47,193 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 236 [2020-09-04 16:12:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:47,193 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2020-09-04 16:12:47,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:12:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2020-09-04 16:12:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-09-04 16:12:47,195 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:47,196 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 16:12:47,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-09-04 16:12:47,196 INFO L427 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:47,196 INFO L82 PathProgramCache]: Analyzing trace with hash 287100319, now seen corresponding path program 1 times [2020-09-04 16:12:47,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:47,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1477253780] [2020-09-04 16:12:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:47,198 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:47,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:47,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:47,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:47,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:47,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:47,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-09-04 16:12:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:12:47,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1477253780] [2020-09-04 16:12:47,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:47,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:12:47,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423908951] [2020-09-04 16:12:47,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:12:47,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:12:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:12:47,580 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 11 states. [2020-09-04 16:12:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:47,869 INFO L93 Difference]: Finished difference Result 334 states and 403 transitions. [2020-09-04 16:12:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:12:47,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 240 [2020-09-04 16:12:47,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:47,872 INFO L225 Difference]: With dead ends: 334 [2020-09-04 16:12:47,872 INFO L226 Difference]: Without dead ends: 272 [2020-09-04 16:12:47,872 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 16:12:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-09-04 16:12:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2020-09-04 16:12:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-09-04 16:12:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2020-09-04 16:12:47,929 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 240 [2020-09-04 16:12:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:47,930 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2020-09-04 16:12:47,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:12:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2020-09-04 16:12:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-09-04 16:12:47,932 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:47,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:12:47,933 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-09-04 16:12:47,933 INFO L427 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash -333217243, now seen corresponding path program 1 times [2020-09-04 16:12:47,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:47,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [491827563] [2020-09-04 16:12:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:47,936 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 16:12:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:12:48,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [491827563] [2020-09-04 16:12:48,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:48,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:12:48,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257799313] [2020-09-04 16:12:48,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:12:48,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:48,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:12:48,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:12:48,216 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 9 states. [2020-09-04 16:12:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:48,445 INFO L93 Difference]: Finished difference Result 331 states and 402 transitions. [2020-09-04 16:12:48,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:12:48,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 241 [2020-09-04 16:12:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:48,448 INFO L225 Difference]: With dead ends: 331 [2020-09-04 16:12:48,448 INFO L226 Difference]: Without dead ends: 319 [2020-09-04 16:12:48,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:12:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-09-04 16:12:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 311. [2020-09-04 16:12:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-09-04 16:12:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 382 transitions. [2020-09-04 16:12:48,528 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 382 transitions. Word has length 241 [2020-09-04 16:12:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:48,528 INFO L479 AbstractCegarLoop]: Abstraction has 311 states and 382 transitions. [2020-09-04 16:12:48,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:12:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 382 transitions. [2020-09-04 16:12:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-09-04 16:12:48,531 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:48,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:12:48,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-09-04 16:12:48,532 INFO L427 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:48,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1780452488, now seen corresponding path program 1 times [2020-09-04 16:12:48,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:48,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [966243762] [2020-09-04 16:12:48,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:48,535 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 16:12:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 16:12:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:12:48,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [966243762] [2020-09-04 16:12:48,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:48,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:12:48,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70356478] [2020-09-04 16:12:48,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:12:48,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:48,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:12:48,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:12:48,856 INFO L87 Difference]: Start difference. First operand 311 states and 382 transitions. Second operand 10 states. [2020-09-04 16:12:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:49,151 INFO L93 Difference]: Finished difference Result 323 states and 393 transitions. [2020-09-04 16:12:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:12:49,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 244 [2020-09-04 16:12:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:49,154 INFO L225 Difference]: With dead ends: 323 [2020-09-04 16:12:49,154 INFO L226 Difference]: Without dead ends: 297 [2020-09-04 16:12:49,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:12:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-09-04 16:12:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 268. [2020-09-04 16:12:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-09-04 16:12:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 305 transitions. [2020-09-04 16:12:49,234 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 305 transitions. Word has length 244 [2020-09-04 16:12:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:49,235 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 305 transitions. [2020-09-04 16:12:49,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:12:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 305 transitions. [2020-09-04 16:12:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-09-04 16:12:49,237 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:49,238 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 16:12:49,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-09-04 16:12:49,238 INFO L427 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:49,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1623599199, now seen corresponding path program 1 times [2020-09-04 16:12:49,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:49,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [247071481] [2020-09-04 16:12:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:49,241 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:49,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:49,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:12:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:49,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:12:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:49,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:12:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:49,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-09-04 16:12:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:49,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-09-04 16:12:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:52,231 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 32 [2020-09-04 16:12:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 16:12:52,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [247071481] [2020-09-04 16:12:52,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:52,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:12:52,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893796941] [2020-09-04 16:12:52,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:12:52,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:52,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:12:52,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:12:52,300 INFO L87 Difference]: Start difference. First operand 268 states and 305 transitions. Second operand 16 states. [2020-09-04 16:13:01,831 WARN L193 SmtUtils]: Spent 4.58 s on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2020-09-04 16:13:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:13:08,367 INFO L93 Difference]: Finished difference Result 327 states and 371 transitions. [2020-09-04 16:13:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:13:08,368 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 245 [2020-09-04 16:13:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:13:08,370 INFO L225 Difference]: With dead ends: 327 [2020-09-04 16:13:08,370 INFO L226 Difference]: Without dead ends: 315 [2020-09-04 16:13:08,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=78, Invalid=521, Unknown=1, NotChecked=0, Total=600 [2020-09-04 16:13:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-09-04 16:13:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 307. [2020-09-04 16:13:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2020-09-04 16:13:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 351 transitions. [2020-09-04 16:13:08,417 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 351 transitions. Word has length 245 [2020-09-04 16:13:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:13:08,417 INFO L479 AbstractCegarLoop]: Abstraction has 307 states and 351 transitions. [2020-09-04 16:13:08,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:13:08,417 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 351 transitions. [2020-09-04 16:13:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-09-04 16:13:08,419 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:13:08,419 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 16:13:08,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-09-04 16:13:08,420 INFO L427 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:13:08,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:13:08,420 INFO L82 PathProgramCache]: Analyzing trace with hash 818281555, now seen corresponding path program 2 times [2020-09-04 16:13:08,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:13:08,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1011212960] [2020-09-04 16:13:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:13:08,422 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:13:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:13:08,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:13:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:13:08,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 16:13:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:13:08,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 16:13:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:13:08,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 16:13:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:13:08,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 16:13:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:13:08,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2020-09-04 16:13:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:13:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 16:13:08,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1011212960] [2020-09-04 16:13:08,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:13:08,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:13:08,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118599337] [2020-09-04 16:13:08,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:13:08,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:13:08,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:13:08,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:13:08,802 INFO L87 Difference]: Start difference. First operand 307 states and 351 transitions. Second operand 9 states. [2020-09-04 16:13:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:13:09,031 INFO L93 Difference]: Finished difference Result 307 states and 351 transitions. [2020-09-04 16:13:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:13:09,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 246 [2020-09-04 16:13:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:13:09,033 INFO L225 Difference]: With dead ends: 307 [2020-09-04 16:13:09,033 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:13:09,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:13:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:13:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:13:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:13:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:13:09,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2020-09-04 16:13:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:13:09,038 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:13:09,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:13:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:13:09,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:13:09,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-09-04 16:13:09,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:13:17,152 WARN L193 SmtUtils]: Spent 7.87 s on a formula simplification. DAG size of input: 492 DAG size of output: 4 [2020-09-04 16:13:28,181 WARN L193 SmtUtils]: Spent 11.02 s on a formula simplification. DAG size of input: 561 DAG size of output: 4 [2020-09-04 16:13:29,982 WARN L193 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 282 DAG size of output: 4 [2020-09-04 16:13:31,124 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 231 DAG size of output: 4 [2020-09-04 16:13:32,713 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 586 DAG size of output: 137 [2020-09-04 16:13:33,006 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 4 [2020-09-04 16:13:37,991 WARN L193 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 427 DAG size of output: 4 [2020-09-04 16:13:40,923 WARN L193 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 337 DAG size of output: 4 [2020-09-04 16:13:49,746 WARN L193 SmtUtils]: Spent 8.82 s on a formula simplification. DAG size of input: 526 DAG size of output: 4 [2020-09-04 16:13:50,387 WARN L193 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 4 [2020-09-04 16:14:02,395 WARN L193 SmtUtils]: Spent 12.01 s on a formula simplification. DAG size of input: 601 DAG size of output: 8 [2020-09-04 16:14:02,543 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 4 [2020-09-04 16:14:13,300 WARN L193 SmtUtils]: Spent 10.76 s on a formula simplification. DAG size of input: 592 DAG size of output: 4 [2020-09-04 16:14:14,679 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 16:14:20,627 WARN L193 SmtUtils]: Spent 5.93 s on a formula simplification. DAG size of input: 459 DAG size of output: 4 [2020-09-04 16:14:22,842 WARN L193 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 309 DAG size of output: 4 [2020-09-04 16:14:24,255 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 256 DAG size of output: 4 [2020-09-04 16:14:25,099 WARN L193 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 4 [2020-09-04 16:14:26,476 WARN L193 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 16:14:37,244 WARN L193 SmtUtils]: Spent 10.76 s on a formula simplification. DAG size of input: 592 DAG size of output: 4 [2020-09-04 16:14:38,615 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 16:14:39,978 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 601 DAG size of output: 136 [2020-09-04 16:14:40,321 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 4 [2020-09-04 16:14:44,440 WARN L193 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 396 DAG size of output: 4 [2020-09-04 16:14:47,718 WARN L193 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 366 DAG size of output: 4 [2020-09-04 16:14:48,168 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 4 [2020-09-04 16:14:57,567 WARN L193 SmtUtils]: Spent 9.09 s on a formula simplification. DAG size of input: 499 DAG size of output: 4 [2020-09-04 16:15:10,493 WARN L193 SmtUtils]: Spent 12.92 s on a formula simplification. DAG size of input: 568 DAG size of output: 4 [2020-09-04 16:15:12,744 WARN L193 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 289 DAG size of output: 4 [2020-09-04 16:15:14,135 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 238 DAG size of output: 4 [2020-09-04 16:15:14,446 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 4 [2020-09-04 16:15:21,099 WARN L193 SmtUtils]: Spent 6.65 s on a formula simplification. DAG size of input: 434 DAG size of output: 4 [2020-09-04 16:15:24,631 WARN L193 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 344 DAG size of output: 4 [2020-09-04 16:15:35,365 WARN L193 SmtUtils]: Spent 10.73 s on a formula simplification. DAG size of input: 533 DAG size of output: 4 [2020-09-04 16:15:36,140 WARN L193 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 4 [2020-09-04 16:15:52,051 WARN L193 SmtUtils]: Spent 15.91 s on a formula simplification. DAG size of input: 578 DAG size of output: 8 [2020-09-04 16:15:52,217 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 4 [2020-09-04 16:16:08,215 WARN L193 SmtUtils]: Spent 16.00 s on a formula simplification. DAG size of input: 571 DAG size of output: 4 [2020-09-04 16:16:09,383 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 16:16:17,093 WARN L193 SmtUtils]: Spent 7.69 s on a formula simplification. DAG size of input: 466 DAG size of output: 4 [2020-09-04 16:16:19,916 WARN L193 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 316 DAG size of output: 4 [2020-09-04 16:16:21,698 WARN L193 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 263 DAG size of output: 4 [2020-09-04 16:16:22,708 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 214 DAG size of output: 4 [2020-09-04 16:16:23,893 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 16:16:39,996 WARN L193 SmtUtils]: Spent 16.10 s on a formula simplification. DAG size of input: 571 DAG size of output: 4 [2020-09-04 16:16:41,167 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 16:16:42,327 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 578 DAG size of output: 13 [2020-09-04 16:16:42,708 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 4 [2020-09-04 16:16:48,171 WARN L193 SmtUtils]: Spent 5.46 s on a formula simplification. DAG size of input: 403 DAG size of output: 4 [2020-09-04 16:16:52,491 WARN L193 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 373 DAG size of output: 4 [2020-09-04 16:16:53,027 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 4 [2020-09-04 16:16:53,143 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 4 [2020-09-04 16:16:54,625 WARN L193 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 4 [2020-09-04 16:16:55,771 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 161 DAG size of output: 4 [2020-09-04 16:16:56,202 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 4 [2020-09-04 16:16:56,520 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 4 [2020-09-04 16:16:57,273 WARN L193 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 16:16:57,447 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 4 [2020-09-04 16:16:58,251 WARN L193 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 4 [2020-09-04 16:16:58,795 WARN L193 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 4 [2020-09-04 16:16:59,850 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 155 DAG size of output: 4 [2020-09-04 16:17:00,078 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 4 [2020-09-04 16:17:01,318 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 171 DAG size of output: 4 [2020-09-04 16:17:02,593 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 164 DAG size of output: 4 [2020-09-04 16:17:03,343 WARN L193 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 16:17:04,250 WARN L193 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 4 [2020-09-04 16:17:04,729 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 4 [2020-09-04 16:17:05,104 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 4 [2020-09-04 16:17:05,389 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 4 [2020-09-04 16:17:06,141 WARN L193 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 16:17:07,322 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 164 DAG size of output: 4 [2020-09-04 16:17:08,081 WARN L193 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 16:17:08,835 WARN L193 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 137 [2020-09-04 16:17:08,984 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 4 [2020-09-04 16:17:09,694 WARN L193 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 4 [2020-09-04 16:17:10,318 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 4 [2020-09-04 16:17:10,511 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 4 [2020-09-04 16:17:11,259 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 4 [2020-09-04 16:17:11,549 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 4 [2020-09-04 16:17:11,664 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 4 [2020-09-04 16:17:11,975 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 16:17:12,238 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 4 [2020-09-04 16:17:12,389 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 4 [2020-09-04 16:17:12,654 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 4 [2020-09-04 16:17:13,032 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 4 [2020-09-04 16:17:13,357 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 4 [2020-09-04 16:17:13,576 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 16:17:13,811 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 4 [2020-09-04 16:17:13,944 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 4 [2020-09-04 16:17:14,057 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 4 [2020-09-04 16:17:14,363 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 16:17:14,660 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 4 [2020-09-04 16:17:14,885 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 16:17:15,109 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2020-09-04 16:17:15,338 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 4 [2020-09-04 16:17:15,501 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 4 [2020-09-04 16:18:15,606 WARN L193 SmtUtils]: Spent 59.59 s on a formula simplification. DAG size of input: 957 DAG size of output: 9 [2020-09-04 16:19:44,305 WARN L193 SmtUtils]: Spent 1.48 m on a formula simplification. DAG size of input: 1093 DAG size of output: 9 [2020-09-04 16:19:56,625 WARN L193 SmtUtils]: Spent 12.32 s on a formula simplification. DAG size of input: 545 DAG size of output: 9 [2020-09-04 16:20:04,002 WARN L193 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 445 DAG size of output: 9 [2020-09-04 16:21:12,546 WARN L193 SmtUtils]: Spent 1.14 m on a formula simplification. DAG size of input: 1495 DAG size of output: 9 [2020-09-04 16:21:12,779 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 9 [2020-09-04 16:21:13,922 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 231 DAG size of output: 9 [2020-09-04 16:21:53,454 WARN L193 SmtUtils]: Spent 39.51 s on a formula simplification. DAG size of input: 829 DAG size of output: 9 [2020-09-04 16:22:13,973 WARN L193 SmtUtils]: Spent 20.52 s on a formula simplification. DAG size of input: 653 DAG size of output: 9 [2020-09-04 16:23:28,165 WARN L193 SmtUtils]: Spent 1.24 m on a formula simplification. DAG size of input: 1024 DAG size of output: 9 [2020-09-04 16:23:31,961 WARN L193 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 353 DAG size of output: 9 [2020-09-04 16:25:19,764 WARN L193 SmtUtils]: Spent 1.80 m on a formula simplification. DAG size of input: 1154 DAG size of output: 11 [2020-09-04 16:25:20,483 WARN L193 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 9